| 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Consider from A061037,Balmer, A145980 (29,139,323,581,) mod 9=period9:repeat 2,4,8,5,4,5,8,4,2 (palindrom) =A146079. a(n)=A146079(1),A146079(4),A146079(7),A146079(10), .. generally A146079(3n+1 or A016777). See submitted A146300. [From Paul Curtz (bpcrtz(AT)free.fr), Nov 01 2008]
Except for the first term of [A047522] and the first term of [A074378], if X=[A047522], Y=[A010709], A=[A074378], we have, for all other terms, Pell's equation X^2-A*Y^2=1. Example 9^2-5*4^2=1; 15^2-14*4^2=1; 17^2-18*4^2=1 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 14 2009]
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1012
|
|
CROSSREFS
|
Cf. A047522, A074378 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 14 2009]
Sequence in context: A088849 A138908 A123932 this_sequence A032564 A141248 A088899
Adjacent sequences: A010706 A010707 A010708 this_sequence A010710 A010711 A010712
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
