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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094301 a(0)=0, a(1)=1, a(2)=2; for n>2, a(n) = a(n-1) - a(n-2) + a(n-3)^2. 0
0, 1, 2, 1, 0, 3, 4, 1, 6, 21, 16, 31, 456, 681, 1186, 208441, 671016, 1869171, 43448848636, 493709451721, 3944060830326, 1887802451244390439101, 245636825165950759470616, 15799364856026522930297791 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

PROG

(Perl) -e '@a=(0, 1, 2); for (3..20){ $a[$_] = $a[$_-1] - $a[$_-2] + $a[$_-3]**2; print "$a[$_], "; }'

(PARI) print1(c=0, ", ", b=1, ", "a=2, ", "); for(n=1, 21, print1(d=a-b+c^2, ", "); c=b; b=a; a=d) - Klaus Brockhaus

CROSSREFS

Sequence in context: A124030 A166040 A106378 * A135488 A099493 A088523

Adjacent sequences:  A094298 A094299 A094300 * A094302 A094303 A094304

KEYWORD

easy,nonn

AUTHOR

Gamo (gamo(AT)telecable.es), Nov 13 2004

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 14 2004

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:03 EST 2012. Contains 205763 sequences.