|
| |
|
|
A060144
|
|
Floor(n/(1+tau)), also Floor(n/(tau)^2).
|
|
4
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 0,7
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
FORMULA
| For n>0, a(n)=n reduced modulo A005206(n). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 01 2003
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
|
|
|
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)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 02 2009]
|
|
|
CROSSREFS
| Sequence in context: A053620 A057360 A057364 * A107347 A189717 A163127
Adjacent sequences: A060141 A060142 A060143 * A060145 A060146 A060147
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), Mar 05 2001
|
| |
|
|
