|
Search: id:A100402
|
|
| |
|
| 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7, 1, 4, 7
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Equals A141725 (1, 13, 61, 253, 1021, 4093, 16381, ...) mod 9 . - Paul Curtz (bpcrtz(AT)free.fr), Sep 15 2008
|
|
EXAMPLE
|
4^2 = 16, droot(16) = 7, the third entry.
|
|
PROGRAM
|
(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: A123734 A011519 A131594 this_sequence A135004 A086234 A016490
Adjacent sequences: A100399 A100400 A100401 this_sequence A100403 A100404 A100405
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004
|
|
|
Search completed in 0.002 seconds
|
