The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211206 Least number which reaches n under the operation introduced in A100787: first differences are the digits of the sequence. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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). LINKS E. Angelini, Smallest hitters, SeqFan list, Feb 04 2013 PROG (PARI) A211206(n)={ for(k=1, n, my(seed=k, d=digits(seed)); while(seed

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 14:42 EST 2022. Contains 350513 sequences. (Running on oeis4.)