login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181614 a(n) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at n, or -1 if a Harshad number is never reached. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 24, 3, 1, 6, 23, 0, 2, 0, 0, 7, 5, 0, 22, 6, 0, 4, 1, 0, 3, 21, 5, 5, 2, 0, 20, 3, 4, 0, 4, 0, 1, 26, 0, 3, 19, 0, 2, 0, 3, 25, 26, 0, 9, 2, 2, 18, 24, 0, 25, 1, 0, 23, 8, 4, 1, 24, 1, 0, 17, 0, 23, 22, 2, 7, 24, 3, 16, 0, 0, 23, 22, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

REFERENCES

Eric Angelini, Posting to Sequence Fans Mailing List, Sep 20 2010

LINKS

Table of n, a(n) for n=1..84.

Hans Havermann, Steps to reach a Harshad

CROSSREFS

Cf. A005349, A062028, A181664.

Sequence in context: A255403 A005079 A167624 * A108321 A059062 A179809

Adjacent sequences:  A181611 A181612 A181613 * A181615 A181616 A181617

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Nov 18 2010

EXTENSIONS

a(22) onward from John W. Layman, Nov 19 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 27 06:50 EDT 2017. Contains 284144 sequences.