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.

A110360 Integers with mutual residues of 8.

Original entry on oeis.org

9, 17, 161, 24641, 606981761, 368426853330807041, 135738346255240000293762417728719361, 18424898644107427010977107148874723523180059431182608785043639266493441
Offset: 1

Views

Author

Seppo Mustonen, Sep 04 2005

Keywords

Comments

This is the special case k=8 of sequences with exact mutual k-residues. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=k, i=1,...,n-1}. k=1 gives Sylvester's sequence A000058 and k=2 Fermat sequence A000215.

Crossrefs

Column k=8 of A177888.

Programs

  • Mathematica
    RecurrenceTable[{a[1]==9, a[n]==a[n-1]*(a[n-1]-8)+8}, a, {n, 1, 10}] (* Vaclav Kotesovec, Dec 17 2014 *)

Formula

a(n) ~ c^(2^n), where c = 1.8813701045812484604409881785833034768479650739052732570542874567824022000... . - Vaclav Kotesovec, Dec 17 2014