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.

A068895 a(1) = 1; a(n) is the smallest cube which is congruent to 1 mod a(n-1).

Original entry on oeis.org

1, 8, 729, 14526784, 10557204381300759489, 43579578335427493547511368128557118597314764434646474944
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2002

Keywords

Examples

			a(3) = 729 = 9^3 = 91*a(2) + 1 where a(2) = 8=2^3 = 7*1 + 1.

Crossrefs

Cf. A068894.

Extensions

a(5) from Donovan Johnson, Mar 10 2010
a(6) from Sean A. Irvine, Mar 23 2024

A116944 a(1) = 1; for n>1, a(n) = (a(n-1)+1)^n.

Original entry on oeis.org

1, 4, 125, 252047376, 1017210679182495207444253709079169646680657
Offset: 1

Views

Author

Vim Wenders, Apr 18 2008

Keywords

Comments

There was a conjecture that this recurrence would produce the sequence A068894, but this is not the case.
a(6) has 253 digits. - Harvey P. Dale, Jan 17 2012

Programs

  • Mathematica
    RecurrenceTable[{a[1]==1,a[n]==(a[n-1]+1)^n},a,{n,6}] (* Harvey P. Dale, Jan 17 2012 *)
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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