|
|
A001056
|
|
a(n) = a(n-1)*a(n-2) + 1, a(0) = 1, a(1) = 3.
(Formerly M2378 N0944)
|
|
3
|
|
|
1, 3, 4, 13, 53, 690, 36571, 25233991, 922832284862, 23286741570717144243, 21489756930695820973683319349467, 500426416062641238759467086706254193219790764168482, 10754042042885415070816603338436200915110904821126871858491675028294447933424899095
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
Archimedeans Problems Drive, Eureka, 19 (1957), 13.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
a:= proc (n) option remember;
if n=0 then 1
elif n=1 then 3
else a(n-1)*a(n-2) + 1
end if
end proc;
|
|
MATHEMATICA
|
RecurrenceTable[{a[0]==1, a[1]==3, a[n]==a[n-1]*a[n-2]+1}, a, {n, 0, 14}] (* Harvey P. Dale, Jul 17 2011 *)
t = {1, 3}; Do[AppendTo[t, t[[-1]] * t[[-2]] + 1], {n, 2, 14}] (* T. D. Noe, Jun 25 2012 *)
|
|
PROG
|
(Haskell)
a001056 n = a001056_list !! n
a001056_list = 1 : 3 : (map (+ 1 ) $
zipWith (*) a001056_list $ tail a001056_list)
(PARI) m=13; v=concat([1, 3], vector(m-2)); for(n=3, m, v[n]=v[n-1]*v[n-2] +1 ); v \\ G. C. Greubel, Sep 19 2019
(Magma) I:=[1, 3]; [n le 2 select I[n] else Self(n-1)*Self(n-2) + 1: n in [1..13]]; // G. C. Greubel, Sep 19 2019
(Sage)
def a(n):
if (n==0): return 1
elif (n==1): return 3
else: return a(n-1)*a(n-2) + 1
(GAP) a:=[1, 3];; for n in [3..13] do a[n]:=a[n-1]*a[n-2]+1; od; a; # G. C. Greubel, Sep 19 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|