|
Search: id:A102865
|
|
|
| A102865 |
|
Base 4 digits are, in order, the first n terms of the sequence (1, 3, 21, 203, 2021, 20203, 202021, 2020203, 20202021, 202020203, ... ). |
|
+0
1
|
|
| 1, 3, 9, 35, 137, 547, 2185, 8739, 34953, 139811, 559241, 2236963, 8947849, 35791395, 143165577, 572662307, 2290649225, 9162596899, 36650387593
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
4^(n+1) = a(n+1) + A037576(n+1)_1 = (1/2)(a(n+2) - a(n)); a(n) + a(n+1) = A039301(n+2)
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 1tesforseq[ + j' - k' + 'ii' - 'ij' - 'ik' ], 1vesforseq(n) = 4^n, 1lesforseq = A037576, apart from initial term. ForType 1A.
|
|
CROSSREFS
|
Cf. A037576.
Sequence in context: A149017 A149018 A149019 this_sequence A046697 A151045 A074507
Adjacent sequences: A102862 A102863 A102864 this_sequence A102866 A102867 A102868
|
|
KEYWORD
|
base,easy,nonn,uned
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Mar 01 2005
|
|
|
Search completed in 0.002 seconds
|
