login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308507 a(n) = (a(n-1) + a(n-2))^4, for n >= 2; a(0)=0, a(1)=1. 0
0, 1, 1, 16, 83521, 48698490414981476161, 5624216052381164150697569400035392464306474190030694298257503425709420810383376 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
EXAMPLE
a(4) = (a(3) + a(2))^4 = (16 + 1)^4 = 83521.
MATHEMATICA
RecurrenceTable[{a[0]==0, a[1]==1, a[n]==(a[n-1]+a[n-2])^4}, a, {n, 10}]
PROG
(Python)
f0 = 0
f1 = 1
next_val = (f0+f1)**4
i = 0
while i <= 10:
next_val = (f0+f1)**4
f0 = f1
f1 = next_val
i = i+1
print(next_val)
CROSSREFS
Sequence in context: A087926 A193135 A368326 * A144830 A278289 A298202
KEYWORD
nonn,less
AUTHOR
John H. Chakkour, Jun 02 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 01:40 EDT 2024. Contains 374905 sequences. (Running on oeis4.)