|
Search: id:A046698
|
|
|
| A046698 |
|
a(0) = 0, a(1) = 1, a(n) = a(a(n-1)) + a(a(n-2)) if n > 1. |
|
+0
15
|
|
| 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Partial sums are A004275. Binomial transform is A048492, starting with 0. - Paul Barry (pbarry(AT)wit.ie), Feb 28 2003
|
|
REFERENCES
|
Sequence proposed by Reg Allenby.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
|
|
FORMULA
|
G.f.: x(1+x^2)/(1-x) - Paul Barry (pbarry(AT)wit.ie), Feb 28 2003
a(n)=2*[(n+2) mod (n+1)]-[C(n^2,n+2) mod 2]-[C((n+1)^2,n+3) mod 2] - Paolo P. Lava (ppl(AT)spl.at), Sep 03 2007
|
|
MAPLE
|
P:=proc(n) local a, i; for i from 0 by 1 to n do a:=2*((i+2) mod (i+1))-(binomial((i)^2, i+2) mod 2)-(binomial((i+1)^2, i+3) mod 2); print(a); od; end: P(100); - Paolo P. Lava (ppl(AT)spl.at), Sep 03 2007
|
|
PROGRAM
|
(PARI) a(n)=(n>0)+(n>2)
|
|
CROSSREFS
|
Sequence in context: A065685 A084100 A130130 this_sequence A036453 A040000 A007395
Adjacent sequences: A046695 A046696 A046697 this_sequence A046699 A046700 A046701
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy
|
|
|
Search completed in 0.007 seconds
|
