Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

    
page 1

Search completed in 0.001 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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research