|
|
A022840
|
|
Beatty sequence for sqrt(6).
|
|
21
|
|
|
2, 4, 7, 9, 12, 14, 17, 19, 22, 24, 26, 29, 31, 34, 36, 39, 41, 44, 46, 48, 51, 53, 56, 58, 61, 63, 66, 68, 71, 73, 75, 78, 80, 83, 85, 88, 90, 93, 95, 97, 100, 102, 105, 107, 110, 112, 115, 117, 120, 122, 124, 127, 129, 132, 134, 137, 139, 142, 144, 146
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers k such that A248515(k+1) = A248515(k) + 1 = 1 + least number h such that 1 - h*sin(1/h) < 1/n^2. The difference sequence of A248515 is (0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, ...), so that A138235 = (1, 3, 5, 6, 8, ...) and A022840 = (2, 4, 7, 9, 12, 14, ...). - Clark Kimberling, Jun 16 2015
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a022840 = floor . (* sqrt 6) . fromIntegral
(PARI) a(n) = floor(n*sqrt(6)) \\ Iain Fox, Nov 20 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|