|
|
|
|
3, 8, 11, 16, 19, 21, 24, 29, 32, 37, 42, 45, 50, 53, 55, 58, 63, 66, 71, 74, 76, 79, 84, 87, 92, 97, 100, 105, 108, 110, 113, 118, 121, 126, 129, 131, 134, 139, 142, 144, 147, 152, 155, 160, 163, 165, 168, 173, 176, 181, 186, 189, 194, 197, 199, 202, 207
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MATHEMATICA
|
a3[n_] := Floor[n (Sqrt[5] + 3)/2];
a5[n_] := Floor[n (Sqrt[5] + 5)/2];
|
|
PROG
|
(PARI) A001950(n) = floor(n*(sqrt(5)+3)/2);
A003231(n) = floor(n*(sqrt(5)+5)/2);
(Haskell)
a003234 n = a003234_list !! (n-1)
a003234_list = [x | x <- [1..],
a003231 (a001950 x) == a001950 (a003231 x) - 1]
(Python)
from math import isqrt
from itertools import count, islice
def A003234_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n:((m:=(n+isqrt(5*n**2)>>1)+n)+isqrt(5*m**2)>>1)+(m<<1)+1==((k:=(n+isqrt(5*n**2)>>1)+(n<<1))+isqrt(5*k**2)>>1)+k, count(max(1, startvalue)))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|