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!)
A014253 a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283). 4
0, 1, 1, 4, 25, 841, 749956, 563696135209, 317754178344723197077225, 100967717855888389973004528722798800700252204356 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..13

Index entries for sequences of form a(n+1)=a(n)^2 + ...

FORMULA

a(n+2) = (a(n+1) + a(n))^2. - Benoit Cloitre, Dec 29 2001

MATHEMATICA

RecurrenceTable[{a[n]==(a[n-1]+a[n-2])^2, a[0]==0, a[1]==1}, a, {n, 0, 10}] (* G. C. Greubel, Jun 18 2019 *)

PROG

(MAGMA) [0] cat [n le 2 select 1 else (Self(n-1)+Self(n-2))^2: n in [1..10]]; // Vincenzo Librandi, Apr 02 2015

(PARI) m=10; v=concat([0, 1], vector(m-2)); for(n=3, m, v[n]=(v[n-1] + v[n-2])^2); v \\ G. C. Greubel, Jun 18 2019

(Sage)

def a(n):

    if (n==0): return 0

    elif (n==1): return 1

    else: return (a(n-1) + a(n-2))^2

[a(n) for n in (0..10)] # G. C. Greubel, Jun 18 2019

CROSSREFS

Sequence in context: A302092 A277110 A072882 * A132553 A305679 A317061

Adjacent sequences:  A014250 A014251 A014252 * A014254 A014255 A014256

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 01:03 EDT 2021. Contains 343579 sequences. (Running on oeis4.)