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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086851 a(0) = 1, a(n+1) = a(n)^2 - n. 6
1, 1, 0, -2, 1, -3, 4, 10, 93, 8641, 74666872, 5575141774264374, 31082205803147712138788845611865, 966103517589229313003894215813508352493573272034098666228778213, 933356006698282312572303256489816012122783406254583141248499016192865214116760703502264792586180597344027491798667186743473356 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

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

MAPLE

a := proc(n) option remember: if n=0 then RETURN(1) fi: a(n-1)^2-n+1: end: for n from 0 to 15 do printf(`%d, `, a(n)) od:

MATHEMATICA

a=1; lst={}; Do[a=a^2-n; AppendTo[lst, a], {n, 0, 14}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 17 2008]

CROSSREFS

Cf. A153059, A153059.

Sequence in context: A007444 A166476 A052950 * A001054 A141487 A099866

Adjacent sequences:  A086848 A086849 A086850 * A086852 A086853 A086854

KEYWORD

sign,easy

AUTHOR

David McLeod Moulton (dmoulton(AT)asianinc.org), Aug 18 2003

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 14 02:39 EST 2012. Contains 205567 sequences.