login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100403 Digital root of 6^n. 2
1, 6, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Also the digital root of k^n for any k == 6 (mod 9). - Timothy L. Tiffin, Dec 02 2023
LINKS
FORMULA
From Timothy L. Tiffin, Dec 01 2023: (Start)
a(n) = 9 for n >= 2.
G.f.: (1+5x+3x^2)/(1-x).
a(n) = A100401(n) for n <> 1.
a(n) = A010888(A000400(n)) = A010888(A001024(n)) = A010888(A009968(n)) = A010888(A009977(n)) = A010888(A009986(n)) = A010888(A159991(n)). (End)
EXAMPLE
For n=8, the digits of 6^8 = 1679616 sum to 36, whose digits sum to 9. So, a(8) = 9. - Timothy L. Tiffin, Dec 01 2023
MATHEMATICA
PadRight[{1, 6}, 100, 9] (* Timothy L. Tiffin, Dec 03 2023 *)
PROG
(PARI) a(n) = if( n<2, [1, 6][n+1], 9); \\ Joerg Arndt, Dec 03 2023
CROSSREFS
Sequence in context: A195296 A273951 A307053 * A066002 A140052 A316072
KEYWORD
easy,nonn,base
AUTHOR
Cino Hilliard, Dec 31 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 12:49 EDT 2024. Contains 372196 sequences. (Running on oeis4.)