|
|
A002062
|
|
a(n) = Fibonacci(n) + n.
(Formerly M0646 N0240)
|
|
13
|
|
|
0, 2, 3, 5, 7, 10, 14, 20, 29, 43, 65, 100, 156, 246, 391, 625, 1003, 1614, 2602, 4200, 6785, 10967, 17733, 28680, 46392, 75050, 121419, 196445, 317839, 514258, 832070, 1346300, 2178341, 3524611, 5702921, 9227500, 14930388, 24157854, 39088207, 63246025
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Let _x indicate the sequence offset. Then a(n+2)_0 = A006355(n+4)_0 - A066982(n+1)_1 (conjecture); (a(n)) = em[K* ]seq( .25'i - .25'j - .25'k - .25i' + .25j' - .75k' - .25'ii' - .25'jj' - .25'kk' - .25'ij' - .25'ik' - .75'ji' + .25'jk' - .25'ki' - .75'kj' + .75e), apart from initial term. - Creighton Dement, Nov 19 2004
|
|
REFERENCES
|
R. Honsberger, Ingenuity in Math., Random House, 1970, p. 96.
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
|
|
|
FORMULA
|
G.f.: x*(-2+3*x) / ( (x^2+x-1)*(x-1)^2 ). - Simon Plouffe in his 1992 dissertation
Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= -3, (F(-k)=(-1)^(k+1)*F(k));
G.f.: x*(2-3*x)/((1-x-x^2)*(1-x)^2). (End)
E.g.f.: 2*exp(x/2)*sinh(sqrt(5)*x/2)/sqrt(5) + x*exp(x). - Ilya Gutkovskiy, Apr 11 2017
|
|
MAPLE
|
a:= n-> combinat[fibonacci](n)+n: seq(a(n), n=0..50); # Zerinvary Lajos, Mar 20 2008
|
|
MATHEMATICA
|
|
|
PROG
|
(MuPAD) numlib::fibonacci(n)+n $ n = 0..50; // Zerinvary Lajos, May 08 2008
(Haskell)
a002062 n = a000045 n + toInteger n
a002062_list = 0 : 2 : 3 : (map (subtract 1) $
zipWith (-) (map (* 2) $ drop 2 a002062_list) a002062_list)
(Magma) [Fibonacci(n)+n: n in [0..50]]; // G. C. Greubel, Jul 09 2019
(Sage) [fibonacci(n)+n for n in (0..50)] # G. C. Greubel, Jul 09 2019
(GAP) List([0..50], n-> Fibonacci(n)+n) # G. C. Greubel, Jul 09 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|