reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Note that all entries terms are divisible by eleven.
proposed
editing
editing
proposed
Erroneous comment deleted by Robert Israel, Jun 02 2023
proposed
editing
editing
proposed
Also multiples of 11 such that the sum of digits at odd positions is different from sum of digits at even positions; cf. A135499. - Reinhard Zumkeller, Jul 05 2014
filter:= proc(n) local L, i;
L:= convert(n, base, 10);
abs(add(L[i]*(-1)^i, i=1..nops(L))) = 11
end proc:
select(filter, [$1..1000] *~ 11); # Robert Israel, Jun 02 2023
approved
editing
editing
approved
Also multiples of 11 such that the sum of digits at odd positions is different from sum of digits at even positions; cf. A135499. - Reinhard Zumkeller, Jul 05 2014
(Haskell)
a060979 n = a060979_list !! (n-1)
a060979_list = filter (\x -> let digs = map (read . return) $ show x in
evens digs /= odds digs) [11, 22 ..]
where evens [] = 0; evens [x] = x; evens (x:_:xs) = x + evens xs
odds [] = 0; odds [x] = 0; odds (_:x:xs) = x + odds xs
-- Reinhard Zumkeller, Jul 05 2014
Cf. A135499.
approved
editing