A003818 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A003818

a(1)=a(2)=1, a(n+1) = (a(n)^3 +1)/a(n-1).

1, 1, 2, 9, 365, 5403014, 432130991537958813, 14935169284101525874491673463268414536523593057

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

The term a(9) has 121 digits. - Harvey P. Dale, Nov 23 2013

The recursion has the Laurent property. If a(1), a(2) are variables, then a(n) is a Laurent polynomial (a rational function with a monomial denominator). - Michael Somos, Feb 25 2019

This sequence was the subject of the 3rd problem of the 14th British Mathematical Olympiad in 1978 where this sequence was defined by: u(1) = 1, u(1) < u(2) and u(n)^3 + 1 = u(n-1) * u(n+1), for n > 1 (see link B. M. O. and reference). - Bernard Schott, Apr 01 2021

REFERENCES

A. Gardiner, The Mathematical Olympiad Handbook: An Introduction to Problem Solving, Oxford University Press, 1997, reprinted 2011, Pb 3 pp. 68 and 204-205 (1978).

LINKS

Table of n, a(n) for n=1..8.

British Mathematical Olympiad, 1978 - Problem 3.

Index to sequences related to Olympiads.

FORMULA

a(n) is asymptotic to c^F(2n) where F(n) is the n-th Fibonacci's number A000045(n) and c=1.1137378757136... - Benoit Cloitre, May 31 2005

May be extended to negative arguments by setting a(n) = a(3-n) for all n in Z. - Michael Somos, Apr 11 2017

MAPLE

A003818 := proc(n) option remember; if n <= 2 then 1 else (A003818(n-1)^3+1)/A003818(n-2); fi; end;

MATHEMATICA

RecurrenceTable[{a[1]==a[2]==1, a[n]==(a[n-1]^3+1)/a[n-2]}, a, {n, 10}] (* Harvey P. Dale, Nov 23 2013 *)

PROG

(PARI) {a(n) = if( n<1, n=3-n); if( n<3, 1, (1 + a(n-1)^3) / a(n-2))}; /* Michael Somos, Apr 11 2017 */

CROSSREFS

Sequence in context: A013093 A013169 A012991 * A325619 A049299 A024225

Adjacent sequences: A003815 A003816 A003817 * A003819 A003820 A003821

KEYWORD

nonn

AUTHOR

Waldemar Pompe (pompe(AT)zodiac1.mimuw.edu.pl)

EXTENSIONS

More terms from Benoit Cloitre, May 31 2005

STATUS

approved