login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022401 Fibonacci sequence beginning 1, 31. 2
1, 31, 32, 63, 95, 158, 253, 411, 664, 1075, 1739, 2814, 4553, 7367, 11920, 19287, 31207, 50494, 81701, 132195, 213896, 346091, 559987, 906078, 1466065, 2372143, 3838208, 6210351, 10048559, 16258910 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (1, 1).

FORMULA

G.f.: (1+30*x)/(1-x-x^2). - Philippe Deléham, Nov 20 2008

a(n) = 31*A000045(n) + A000045(n-1). [Paolo P. Lava, May 19 2015]

MAPLE

with(numtheory): with(combinat): P:=proc(q) local n;

for n from 0 to q do print(31*fibonacci(n)+fibonacci(n-1));

od; end: P(30); # Paolo P. Lava, May 19 2015

MATHEMATICA

a={}; b=1; c=31; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 40, 1}]; a (* Vladimir Joseph Stephan Orlovsky, Jul 23 2008 *)

CoefficientList[Series[(1 + 30 x)/(1 - x - x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Oct 30 2014 *)

PROG

(MAGMA) I:=[1, 31]; [n le 2 select I[n] else Self(n-1)+Self(n-2): n in [1..40]]; // Vincenzo Librandi, Oct 30 2014

CROSSREFS

a(k) = A118654(5, k).

Sequence in context: A165852 A256496 A133782 * A042936 A042934 A042930

Adjacent sequences:  A022398 A022399 A022400 * A022402 A022403 A022404

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 28 05:58 EDT 2017. Contains 288813 sequences.