|
Search: id:A078607
|
|
|
| A078607 |
|
Least positive integer x such that 2*x^n>(x+1)^n. |
|
+0
3
|
|
| 3, 4, 6, 7, 9, 10, 12, 13, 14, 16, 17, 19, 20, 22, 23, 25, 26, 27, 29, 30, 32, 33, 35, 36, 38, 39, 40, 42, 43, 45, 46, 48, 49, 50, 52, 53, 55, 56, 58, 59, 61, 62, 63, 65, 66, 68, 69, 71, 72, 74, 75, 76, 78, 79, 81, 82, 84, 85, 87, 88, 89, 91, 92, 94, 95, 97, 98, 100, 101, 102
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
FORMULA
|
a(n) = ceiling(1/(2^(1/n)-1)). For most n, a(n) is the nearest integer to n/log(2), but there are exceptions, including n=777451915729368.
|
|
EXAMPLE
|
a(2)=3 as 2^2=4, 3^2=9 and 4^2=16.
|
|
PROGRAM
|
(PARI) for (n=2, 50, x=2; while (2*x^n<=((x+1)^n), x++); print1(x", "))
|
|
CROSSREFS
|
Cf. A078608, A078609.
Sequence in context: A070762 A061208 A130269 this_sequence A026322 A049624 A084056
Adjacent sequences: A078604 A078605 A078606 this_sequence A078608 A078609 A078610
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Dec 09 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Dec 17 2002
|
|
|
Search completed in 0.002 seconds
|
