|
| |
|
|
A120437
|
|
Differences of A037314 (sum of base 3 digits of n=sum of base 9 digits of n).
|
|
1
| |
|
|
1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 547, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 547, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1, 61, 1, 1, 7, 1, 1, 7, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| It appears that the sequence is given by the following recursion: a(n)=1 if n=1, a(n)=9a(3^(k-1))-2 if n=3^k for some k>0, a(n)=a(n-3^(k-1)) if 3^(k-1)<n<3^k for some k>0. This recursion formula has been verified for n<=2000.
a(n) = A066443(A007949(n)). (This is equivalent to the conjectured recursion above; that recursion is correct.) - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 24 2006
|
|
|
CROSSREFS
| Cf. A000695, A037314, A066443, A007949.
Sequence in context: A102421 A019620 A105395 * A174095 A050179 A183352
Adjacent sequences: A120434 A120435 A120436 * A120438 A120439 A120440
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| John W. Layman (layman(AT)math.vt.edu), Jul 17 2006
|
| |
|
|
