Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063569
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A063569
%S A063569 9,3,3,2,6,6,1,5,12,4,9,16,4,13,28,18,3,10,15,21,26,3,22,12,27,26,17,7,
%T A063569 16,4,13,22,24,12,27,19,2,21,22,30,13,14,22,25,17,15,6,15,28,15,21,31,
%U A063569 46,23,28,18,6,15,20,17,10,8,11,33,14,6,6,8,18,9,11,22,26,17,16,33
%N A063569 6^a(n) is smallest positive power of 6 containing the string 'n'.
%t A063569 a = {}; Do[k = 1; While[ StringPosition[ ToString[6^k], ToString[n] ] 
               == {}, k++ ]; a = Append[a, k], {n, 0, 60} ]; a
%Y A063569 Essentially the same as A062523.
%Y A063569 Sequence in context: A021842 A011112 A138064 this_sequence A037921 A019878 
               A097902
%Y A063569 Adjacent sequences: A063566 A063567 A063568 this_sequence A063570 A063571 
               A063572
%K A063569 base,nonn
%O A063569 0,1
%A A063569 Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 10 2001

    
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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research