|
|
A060144
|
|
a(n) = floor(n/(1+tau)), or equivalently floor(n/(tau)^2), where tau is the golden ratio (A001622).
|
|
15
|
|
|
0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 27, 27, 27, 28, 28, 29, 29
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
REFERENCES
|
Martin Griffiths, A formula for an infinite family of Fibonacci-word sequences, Fib. Q., 56 (2018), 75-80.
|
|
LINKS
|
D. R. Hofstadter, Eta-Lore [With permission]
|
|
FORMULA
|
Let n' = n-1. Above formula is better as a(n') = n'-A005206(n'). Also a(n') = A005206(A005206(n'-1)). Also a(n'+1) = n'-a(n')-a(n'-a(n')), with a(0) = 0. - Frank Ruskey, Dec 09 2011
|
|
MAPLE
|
(3+sqrt(5))/2 ;
floor(n/%) ;
end proc:
|
|
MATHEMATICA
|
Table[Floor[n/GoldenRatio^2], {n, 0, 100}] (* T. D. Noe, Dec 10 2011 *)
|
|
PROG
|
(PARI)
{ default(realprecision, 10); f=2/(sqrt(5) + 3); for (n=0, 1000, write("b060144.txt", n, " ", floor(n*f)); ) } \\ Harry J. Smith, Jul 02 2009
(Haskell)
a060144 n = a060144_list !! n
a060144_list = 0 : 0 : scanl1 (+) a003849_list
(Python)
from math import isqrt
def A060144(n): return (n<<1)-1-(n+isqrt(5*n**2)>>1) if n else 0 # Chai Wah Wu, Aug 09 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|