|
Search: id:A103341
|
|
|
| A103341 |
|
Numbers n such that floor(n*sqrt(2)) is a power of 2. |
|
+0
1
|
|
| 1, 2, 3, 6, 12, 23, 91, 2897, 5793, 23171, 46341, 92682, 185364, 370728, 1482911, 2965821, 5931642, 23726567, 47453133, 94906266, 379625063, 759250125, 1518500250, 3037000500, 6074001000, 12148002000, 24296004000, 48592008000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sequence is infinite.
|
|
REFERENCES
|
Jean-Marie De Koninck and Armel Mercier, 1001 problemes en theorie classique des nombres, ellipses, 2004, pp. 117, 374-375.
|
|
PROGRAM
|
(PARI) for(k=0, 40, n=ceil(2^k/sqrt(2)); if(floor(n*sqrt(2))==2^k, print1(n, ", "))) - Robert Gerbicz (robert.gerbicz(AT)gmail.com), Jun 09 2007
|
|
CROSSREFS
|
Sequence in context: A154324 A001630 A164363 this_sequence A023675 A029996 A038085
Adjacent sequences: A103338 A103339 A103340 this_sequence A103342 A103343 A103344
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 13 2007
|
|
EXTENSIONS
|
More terms from Robert Gerbicz (robert.gerbicz(AT)gmail.com), Jun 09 2007
|
|
|
Search completed in 0.002 seconds
|
