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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262184 a(n) = Fibonacci(n)^2 - Fibonacci(n) + 1. 0
1, 1, 1, 3, 7, 21, 57, 157, 421, 1123, 2971, 7833, 20593, 54057, 141753, 371491, 973183, 2548813, 6674473, 17476581, 45758461, 119803971, 313661811, 821194993, 2149945057, 5628675601, 14736139057, 38579834307, 101003513911, 264430950213, 692289729561 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Subsequence of A002061.

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (4,-2,-6,4,2,-1).

FORMULA

a(n) = A000045(n)^2 - A000045(n) + 1.

G.f.: -(x^5+x^4-7*x^3+x^2+3*x-1) / ((x-1)*(x+1)*(x^2-3*x+1)*(x^2+x-1)). - Alois P. Heinz, Sep 15 2015

EXAMPLE

For n=2, a(n) = Fibonacci(n)^2 - Fibonacci(n) + 1 = 1^2 - 1 + 1 = 1.

PROG

(PARI) a(n) = fibonacci(n)^2 - fibonacci(n) + 1;

vector(30, n, a(n))

CROSSREFS

Cf. A000045, A002061.

Sequence in context: A151267 A319558 A320803 * A091489 A047087 A104779

Adjacent sequences:  A262181 A262182 A262183 * A262185 A262186 A262187

KEYWORD

nonn,easy

AUTHOR

Altug Alkan, Sep 14 2015

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 March 22 10:07 EDT 2019. Contains 321421 sequences. (Running on oeis4.)