Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117386
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A117386
%S A117386 1,2,3,4,1,5,6,7,8,2,9,10,11,12,3,13,14,15,16,4,17,18,19,5,20,21,22,23,
%T A117386 6,24,25,26,27,7,28,29,30,31,8,32,33,34,9,35,36,37,38,10,39,40,41,42,11,
%U A117386 43,44,45,46,12,47,48,49,13,50,51,52,53,14,54,55,56,57,15,58,59,60,61
%N A117386 Positive integers, each occurring twice in the sequence, such that a(n) 
               = a(k) when n+k = 6*a(n), starting with a(1)=1 and filling the next 
               vacant position with the smallest unused number.
%F A117386 a(6*a(n)-n) = a(n). Conjecture: Lim_inf a(n)/n = (3-sqrt(3))/6; Lim_sup 
               a(n)/n = (3+sqrt(3))/6.
%o A117386 (PARI) {a(n)=local(A=vector(n),m=1); for(k=1,n,if(A[k]==0,A[k]=m;if(6*m-k<=#A,
               A[6*m-k]=m);m+=1));A[n]}
%Y A117386 Cf. A117384 (a(4*a(n)-n)=a(n)), A117385 (a(5*a(n)-n)=a(n)).
%Y A117386 Sequence in context: A055441 A104717 A067003 this_sequence A101174 A050144 
               A124406
%Y A117386 Adjacent sequences: A117383 A117384 A117385 this_sequence A117387 A117388 
               A117389
%K A117386 nonn
%O A117386 1,2
%A A117386 Paul D. Hanna (pauldhanna(AT)juno.com), Mar 11 2006

    
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