|
Search: id:A133470
|
|
|
| A133470 |
|
a(n) = nth number for which floor(b(p))=floor(b(p-1)), where b(p)=sum{k;1;p}(i/(i+2)). |
|
+0
1
|
|
| 2, 5, 9, 17, 29, 49, 81, 135, 225, 371, 614, 1013, 1672, 2757, 4548, 7499, 12365, 20358, 33615, 55423, 91378, 150659, 248395, 409536, 675212
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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).
|
|
EXAMPLE
|
floor(b(1))=floor(1/3)=0
floor(b(2))=floor(1/3+2/4)=0
hence a(1) = 2
|
|
PROGRAM
|
(PARI) (A=0); for((n=1, 1000000, B+A; A=B+(n/(n+2)); if(floor(A)-floor(B)-1, print(n)))
|
|
CROSSREFS
|
Sequence in context: A000097 A081996 A034329 this_sequence A129696 A082281 A000569
Adjacent sequences: A133467 A133468 A133469 this_sequence A133471 A133472 A133473
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 28 2007
|
|
|
Search completed in 0.002 seconds
|
