|
| |
|
|
A010709
|
|
Constant sequence: the all 4's sequence.
|
|
8
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| 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]
Contribution from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 25 2010: (Start)
Continued fraction expansion of 2+sqrt(5).
Decimal expansion of 4/9.
Inverse binomial transform of A020707. (End)
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1012
|
|
|
FORMULA
| Contribution from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 25 2010: (Start)
a(n) = 4.
G.f.: 4/(1-x). (End)
E.g.f.: 4*e^x. - Vincenzo Librandi, Jan 29 2012
|
|
|
CROSSREFS
| Contribution from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 25 2010: (Start)
Equals 4*A000012, 2*A007395, A010731/2, A010855/4, A010871/8.
Cf. A098317 (decimal expansion of 2+sqrt(5)), A020707 (2^(n+2)). (End)
Sequence in context: A088848 A088849 A123932 * A138908 A032564 A141248
Adjacent sequences: A010706 A010707 A010708 * A010710 A010711 A010712
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
