The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100403 Digital root of 6^n. 1
 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 LINKS PROG (PARI) f(n, m) = for(x=0, n, print1(droot(m^x)", ")) droot(n) = \ the digital root of a number. { local(x); x= n%9; if(x>0, return(x), return(9)) } CROSSREFS Sequence in context: A195296 A273951 A307053 * A066002 A140052 A316072 Adjacent sequences:  A100400 A100401 A100402 * A100404 A100405 A100406 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 3 13:49 EDT 2020. Contains 336198 sequences. (Running on oeis4.)