|
|
A001603
|
|
Odd-indexed terms of A124296.
(Formerly M4801 N2051)
|
|
4
|
|
|
1, 11, 101, 781, 5611, 39161, 270281, 1857451, 12744061, 87382901, 599019851, 4105974961, 28143378001, 192899171531, 1322154751061, 9062194370461, 62113232767531, 425730505493801, 2918000490238361, 20000273409331051, 137083914639998701, 939587132382262661
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Old name: Related to factors of Fibonacci numbers.
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Dov Jarden, Recurring Sequences, Riveon Lematematika, Jerusalem, 1966. [Annotated scanned copy] See p. 20.
|
|
FORMULA
|
G.f.: -(1+13*x^2+x^4)/((x-1)*(x^2-3*x+1)*(x^2-7*x+1)). [After Simon Plouffe]
|
|
MAPLE
|
A001603:=-(1+13*z**2+z**4)/(z-1)/(z**2-3*z+1)/(z**2-7*z+1); # conjectured (correctly) by Simon Plouffe in his 1992 dissertation
|
|
MATHEMATICA
|
5 #^2 - 5 # + 1 &@ Fibonacci@ # & /@ Range[1, 43, 2] (* Michael De Vlieger, Apr 03 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|