Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133470
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A133470
%S A133470 2,5,9,17,29,49,81,135,225,371,614,1013,1672,2757,4548,7499,12365,20358,
%T A133470 33615,55423,91378,150659,248395,409536,675212
%N A133470 a(n) = nth number for which floor(b(p))=floor(b(p-1)), where b(p)=sum{k;
               1;p}(i/(i+2)).
%C A133470 I conjecture that a(n)/a(n-1) tends toward sqrt(Euler) when n tends toward 
               infinity. For integers not in the sequence, b(p)=1+b(p-1).
%e A133470 floor(b(1))=floor(1/3)=0
%e A133470 floor(b(2))=floor(1/3+2/4)=0
%e A133470 hence a(1) = 2
%o A133470 (PARI) (A=0);for((n=1,1000000,B+A;A=B+(n/(n+2));if(floor(A)-floor(B)-1,
               print(n)))
%Y A133470 Sequence in context: A000097 A081996 A034329 this_sequence A129696 A082281 
               A000569
%Y A133470 Adjacent sequences: A133467 A133468 A133469 this_sequence A133471 A133472 
               A133473
%K A133470 easy,nonn
%O A133470 1,1
%A A133470 Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 28 2007

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research