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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086064 In decimal representation: smallest k>1 such that n is a substring of n*k. 1
2, 10, 6, 10, 6, 3, 6, 10, 6, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 10, 10, 10, 10, 5, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

1 < a(n) <= 10; 4, 7 and 8 do not occur.

FORMULA

a(n) = A087217(n)/n for n>0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 26 2003

CROSSREFS

Cf. A045537.

Sequence in context: A047816 A095845 A105801 * A076374 A142954 A082225

Adjacent sequences:  A086061 A086062 A086063 * A086065 A086066 A086067

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 24 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:41 EST 2012. Contains 206041 sequences.