cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A068508 a(n) = round((a(n-1) + a(n-2))/a(n-3)) starting with a(1)=a(2)=a(3)=1.

Original entry on oeis.org

1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1, 1, 1, 2, 3, 5, 4, 3, 1
Offset: 1

Views

Author

Henry Bottomley, Mar 25 2002

Keywords

Comments

While this sequence has period 8, the unrounded version b(n) = (b(n-1) + b(n-2))/b(n-3) seems to have a quasi-period of about 8.7 for this particular starting point.
The unrounded version b(n) = A185332(n) / A185341(n) as given in A205303 has 8.694171... quasi-period. - Michael Somos, Oct 22 2018

Examples

			a(7) = round((a(6) + a(5))/a(4)) = round((5+3)/2) = 4.
		

Crossrefs

Formula

a(n) = a(n-8).

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

Original entry on oeis.org

1, 2, 7, 335, 37595032, 53136308104856854277393, 150028625136232090492356612601560283583272160844416809510162344944689
Offset: 1

Views

Author

Keywords

Comments

Next terms are 205 and 614 digits long.

Crossrefs

Cf. A048112.

Programs

  • Mathematica
    RecurrenceTable[{a[1]==1,a[2]==2,a[n]==a[n-1]^3-a[n-2]^3},a,{n,8}] (* Harvey P. Dale, Mar 20 2013 *)

Extensions

More terms from Patrick De Geest, Jun 15 1999
Showing 1-2 of 2 results.