|
Search: id:A029898
|
|
|
| A029898 |
|
Pitoun's sequence: a(n+1) is digital root of a(0)+...+a(n). |
|
+0
16
|
|
| 1, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
If the initial 1 is omitted, this is 2^n mod 9. - N. J. A. Sloane (njas(AT)research.att.com).
Except for the initial term, also the digital root of 11^n. Except for the initial term, also the decimal expansion of 125/1001. Except for the initial term, also the digital root of 2^n. - Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004
|
|
FORMULA
|
a(n) = digital root of 2^(n-1) in base 10 = 2^(n-1) (mod 9). - Olivier Gerard (olivier.gerard(AT)gmail.com), Jun 06 2001
For n>0: a(n+6)=a(n) and a(n)=A007612(n+1)-A007612(n)=A010888(A007612(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 27 2006
|
|
EXAMPLE
|
1+1+2+4+8+7+5 = 28 -> 2+8 = 10 -> a(7) = 1.
|
|
PROGRAM
|
(Other) sage: [power_mod(2, n, 9)for n in xrange(0, 105)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
|
|
CROSSREFS
|
Sequence in context: A016017 A071571 A153130 this_sequence A021406 A065075 A001370
Adjacent sequences: A029895 A029896 A029897 this_sequence A029899 A029900 A029901
|
|
KEYWORD
|
base,nonn,nice
|
|
AUTHOR
|
Amela2(AT)aol.com
|
|
EXTENSIONS
|
More terms from Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004
|
|
|
Search completed in 0.002 seconds
|
