Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086064
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A086064
%S A086064 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,
%T A086064 10,10,10,10,10,10,10,10,10,10,10,10,10,10,6,10,10,10,10,10,10,10,10,10,
%U A086064 3,10,10,10,10,10,10,10,10,10,6,10,10,10,10,10,10,10,10,10,10
%N A086064 In decimal representation: smallest k>1 such that n is a substring of 
               n*k.
%C A086064 1 < a(n) <= 10; 4, 7 and 8 do not occur.
%F A086064 a(n) = A087217(n)/n for n>0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Aug 26 2003
%Y A086064 Cf. A045537.
%Y A086064 Sequence in context: A047816 A095845 A105801 this_sequence A076374 A142954 
               A082225
%Y A086064 Adjacent sequences: A086061 A086062 A086063 this_sequence A086065 A086066 
               A086067
%K A086064 nonn,base
%O A086064 0,1
%A A086064 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 24 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research