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.

A211206 Least number which reaches n under the operation introduced in A100787: first differences are the digits of the sequence.

Original entry on oeis.org

1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 5, 3, 3, 5, 3, 1, 1, 5, 3, 3, 11, 5, 1, 1, 3, 3, 5, 5, 19, 13, 1, 3, 1, 5, 7, 1, 7, 1, 7, 5, 5, 1, 13, 3, 1, 1, 11, 9, 1, 5, 3, 1, 3, 11, 1, 9, 20, 13, 3, 7, 1, 3, 5, 1, 5, 9, 3, 5, 9, 3, 11, 1, 7, 3, 11, 1, 5, 1
Offset: 1

Views

Author

Eric Angelini and M. F. Hasler, Feb 04 2013

Keywords

Comments

E. Angelini proposes to call Wilsonize(n) the sequence starting with n and having as first differences the digits of the (concatenated) terms of the sequence. Then this sequence lists the smallest starting value a(n)=k such that n is a term of Wilsonize(k).

Programs

  • PARI
    A211206(n)={ for(k=1,n, my(seed=k,d=digits(seed)); while(seed