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.

A063423 a(1) = 9, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).

Original entry on oeis.org

9, 33, 311, 1311, 2357, 12357, 91373, 191373, 273701, 594639, 966071, 3792549, 7714919, 18474177, 36158059, 217166627, 415296747, 1269327263, 8581147923, 85531003291, 307572780863, 417501775143, 594709702027, 1334471501519
Offset: 1

Views

Author

Robert G. Wilson v, Aug 09 2001

Keywords

Crossrefs

Programs

  • Mathematica
    f[ n_Integer ] := (d = Divisors[ n ]; l = Length[ d ]; If[ EvenQ[ l ], ToExpression[ ToString[ d[ [ l/2 ] ] ] <> ToString[ d[ [ l/2 + 1 ] ] ] ], ToExpression[ ToString[ d[ [ l/2 + .5 ] ] ] <> ToString[ d[ [ l/2 + .5 ] ] ] ] ] ); NestList[ f, 9, 25 ]