login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032945 Numbers n such that base 10 representation Sum{d(i)*10^(m-i): i=0,1,...,m} has d(i)=0 for all odd i. Here m is the position of the lead digit of n. 4
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 400, 401, 402, 403 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Every nonnegative integer can be represented as the sum of two members of this sequence. - Franklin T. Adams-Watters, Aug 30 2014

This first differs from A236402 in a(110)=1000 (followed by 1010, 1020, 1030, ...), while A236402(110)=910 (followed by 1000, 1001, 1002, ...). - M. F. Hasler, Dec 28 2014

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

N:= 6: # to get all terms with up to N digits

A[1]:= 0:

count:= 1:

for d from 1 to N do

   dp:= ceil(d/2);

   for j from 10^(dp-1) to 10^dp-1 do

      L:= ListTools[Reverse](convert(j, base, 10));

      L:= ListTools[Interleave](L, [0$(d-dp)]);

      count:= count+1;

      A[count]:= add(L[i]*10^(d-i), i=1..d);

    od

od:

seq(A[i], i=1..count); # Robert Israel, Aug 31 2014

PROG

(PARI) is(n)=!forstep(i=2, #n=digits(n), 2, n[i]&&return) \\ M. F. Hasler, Dec 28 2014

CROSSREFS

Cf. A126684.

Sequence in context: A107085 A212499 A244890 * A236402 A052018 A302768

Adjacent sequences:  A032942 A032943 A032944 * A032946 A032947 A032948

KEYWORD

nonn,base

AUTHOR

Clark Kimberling

EXTENSIONS

Definition corrected by Franklin T. Adams-Watters, Aug 30 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 04:54 EDT 2020. Contains 337295 sequences. (Running on oeis4.)