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.

A058361 a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.

Original entry on oeis.org

3, 1, 4, 15, 22, 121, 735, 31, 46, 22143, 4468, 67, 31455, 391, 2308, 447, 94, 33151, 16383, 139, 202, 7551, 5224, 787, 1595391, 3685, 580, 30591, 418, 42495, 1791, 607, 1342, 3217407, 1095166, 283, 398847, 32767, 365311, 88575, 1174, 6925, 12304383
Offset: 1

Views

Author

Robert G. Wilson v, Dec 16 2000

Keywords

Crossrefs

Programs

  • Mathematica
    k = {1}; Do[ k = Union[ Join[ k, 2k + 1, 3k + 1 ] ]; l = Length[ k ]; i = 1; While[ i < l && k[ [ i ] ] < 10^9, i++ ]; k = Take[ k, {1, i} ], {n, 1, 30} ]; f[ n_Integer ] := (i = 1; While[ k[ [ i + 1 ] ] - k[ [ i ] ] != n, i++ ]; k[ [ i ] ]); Table[ f[ n ], {n, 1, 84} ]