|
Search: id:A102251
|
|
|
| A102251 |
|
Begin with 1, multiply each digit by 2. |
|
+0
2
|
|
| 1, 2, 4, 8, 16, 2, 12, 4, 2, 4, 8, 4, 8, 16, 8, 16, 2, 12, 16, 2, 12, 4, 2, 4, 2, 12, 4, 2, 4, 8, 4, 8, 4, 2, 4, 8, 4, 8, 16, 8, 16, 8, 4, 8, 16, 8, 16, 2, 12, 16, 2, 12, 16, 8, 16, 2, 12, 16, 2, 12, 4, 2, 4, 2, 12, 4, 2, 4, 2, 12, 16, 2, 12, 4, 2, 4, 2, 12, 4, 2, 4, 8, 4, 8, 4, 2, 4, 8, 4, 8, 4, 2, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Same digits as A061581 without the memory of the groupings of the preceding digits. A bunch of sequences can be produced with this rule: a(n)=d*k beginning with 1,2,3... for k=2,3,...
|
|
FORMULA
|
d*2, beginning with 1
|
|
EXAMPLE
|
Read a(5)=16 which produces a(6)=2 because 1*2=2 and a(7)=12 because 6*2=12. Now read a(6)=2 which produces [a(7) is already written] a(8)=4 because 2*2=4.
|
|
MATHEMATICA
|
Flatten[ NestList[ Function[x, Flatten[ FromDigits /@ 2IntegerDigits[ x]]], 1, 15]] (from Robert G. Wilson v Feb 21 2005)
|
|
CROSSREFS
|
Cf. A061581.
Sequence in context: A089738 A110333 A069783 this_sequence A036122 A050124 A101943
Adjacent sequences: A102248 A102249 A102250 this_sequence A102252 A102253 A102254
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Alexandre Wajnberg & Eric Angelini (alexandre.wajnberg(AT)ulb.ac.be), Feb 18 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 21 2005
|
|
|
Search completed in 0.002 seconds
|
