|
| |
|
|
A076452
|
|
a(n+2) = abs(a(n+1)) - a(n), a(0)=0, a(1)=1.
|
|
0
| |
|
|
0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,7
|
|
|
REFERENCES
| M. Crampin, Piecewise linear recurrence relations, Math. Gaz., November 1992, p. 355.
J. F. Slifker, Solution to Problem 6439 proposed by M. Brown, Amer. Math. Monthly, 92 (1985), p. 218.
|
|
|
FORMULA
| a(n)=(1/81)*{-8*(n mod 9)+19*[(n+1) mod 9]+10*[(n+2) mod 9]-8*[(n+3) mod 9]-17*[(n+4) mod 9]+10*[(n+5) mod 9]+10*[(n+6) mod 9]+[(n+7) mod 9]-8*[(n+8) mod 9]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Jun 29 2009]
|
|
|
CROSSREFS
| Sequence in context: A157361 A101808 A145865 * A076453 A005590 A142598
Adjacent sequences: A076449 A076450 A076451 * A076453 A076454 A076455
|
|
|
KEYWORD
| sign
|
|
|
AUTHOR
| Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 07 2002
|
| |
|
|
