|
Search: id:A070403
|
|
| |
|
| 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4, 1, 7, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Also the digital root of 7^n. If we convert this to a repeating decimal 0.174174.., we get the rational number 58/333. - Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004
A141722 (1, 25, 121, 505, 2041, 8185) mod 9 . Note A141722=10*A000975(2n)+A000975(2n+1). [From Paul Curtz (bpcrtz(AT)free.fr), Sep 15 2008]
|
|
FORMULA
|
a(n)=(1/3)*{7*(n mod 3)+7*[(n+1) mod 3]-2*[(n+2) mod 3]}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Oct 21 2008]
G.f.: (1+7x+4x^2)/((1-x)(1+x+x^2)). a(n+1)-a(n)=3*A099837(n+3). a(n)=4-3*A049347(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 23 2009]
|
|
PROGRAM
|
(Other) sage: [power_mod(7, n, 9)for n in xrange(0, 105)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
|
|
CROSSREFS
|
Sequence in context: A131028 A010138 A010508 this_sequence A144468 A059630 A011407
Adjacent sequences: A070400 A070401 A070402 this_sequence A070404 A070405 A070406
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 12 2002
|
|
|
Search completed in 0.002 seconds
|
