login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245306 a(n) = Fibonacci(n)^2+1. 4
1, 2, 2, 5, 10, 26, 65, 170, 442, 1157, 3026, 7922, 20737, 54290, 142130, 372101, 974170, 2550410, 6677057, 17480762, 45765226, 119814917, 313679522, 821223650, 2149991425, 5628750626, 14736260450, 38580030725, 101003831722, 264431464442, 692290561601 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) is the product of two Fibonacci numbers.

LINKS

Table of n, a(n) for n=0..30.

FORMULA

a(2n) = A001519(n)* A001519(n+1) and a(2n+1)= A001519(n)* A001519(n+2).

a(n) = A007598(n)+1.

G.f.: -(2*x^3-4*x^2-x+1)/(x^4-3*x^3+3*x-1). - Alois P. Heinz, Jul 17 2014

EXAMPLE

a(9) = Fibonacci(9)^2+1 = 34^2+1 = 1157 = A001519(4)* A001519(6)= 13*89.

MAPLE

with(numtheory):with(combinat, fibonacci):nn:=100:for i from 0 to nn do:x:=fibonacci(i)^2+1: printf(`%d, `, x):od:

MATHEMATICA

Fibonacci[Range[0, 30]]^2+1 (* Harvey P. Dale, Aug 05 2018 *)

CROSSREFS

Cf. A000045, A001519, A007598, A080097.

Sequence in context: A075125 A081374 A243338 * A296530 A117400 A005637

Adjacent sequences:  A245303 A245304 A245305 * A245307 A245308 A245309

KEYWORD

nonn,easy

AUTHOR

Michel Lagneau, Jul 17 2014

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 12:14 EST 2020. Contains 331996 sequences. (Running on oeis4.)