References to A181664

Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.
15, 19, 14, 28, 23, 16, 22, 65, 55, 142, 134, 130, 119, 109, 95, 79, 71, 58, 47, 37, 32


1 seqfan posts

Fri Nov 19 03:57:05 CET 2010    [seqfan] Re: Chasing base-10 Harshads

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .