|
|
A005210
|
|
a(n) = |a(n-1) + 2a(n-2) - n|.
(Formerly M0400)
|
|
11
|
|
|
1, 1, 0, 2, 3, 1, 0, 6, 3, 5, 0, 2, 11, 1, 8, 6, 5, 1, 8, 10, 5, 3, 10, 8, 3, 7, 14, 0, 1, 29, 0, 26, 7, 25, 4, 18, 11, 9, 8, 14, 11, 3, 18, 20, 11, 5, 20, 18, 9, 5, 28, 14, 17, 9, 12, 26, 7, 1, 44, 14, 41, 7, 26, 24, 11, 7, 38, 16, 23, 15, 10, 32, 21, 11, 22, 32, 1, 13, 64, 10, 57, 5, 36, 38, 25, 15, 22, 36
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
It seems likely that every number will eventually appear.
|
|
REFERENCES
|
Popular Computing (Calabasas, CA), Z-Sequences, Vol. 4 (No. 42, Sep 1976), pp. 12-16.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Popular Computing (Calabasas, CA), Z-Sequences, continued. Annotated and scanned copy of pages 14, 15, 16, 18 of Vol. 5 (No. 56, Nov 1977).
|
|
MAPLE
|
f:=proc(n) option remember;
if n <= 1 then 1 else abs(2*f(n-2)+f(n-1)-n); fi; end;
|
|
MATHEMATICA
|
RecurrenceTable[{a[1]==a[2]==1, a[n]==Abs[a[n-1]+2a[n-2]-n]}, a, {n, 90}] (* Harvey P. Dale, Mar 23 2012 *)
|
|
PROG
|
(Haskell)
a005210 n = a005210_list !! (n-1)
a005210_list = 1 : 1 : (zipWith ((abs .) . (-))
[3..] $ zipWith (+) (tail a005210_list) (map (2 *) a005210_list))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|