|
| |
| |
|
|
|
1, 2, 1, 0, 2, 2, 2, 2, 1, 0, 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 2, 0, 1, 2, 2, 2, 2, 0, 1, 2, 1, 0, 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;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
As usual, "mod 3" means to choose the unique representative in { 0,1,2 } of the equivalence class modulo 3Z.
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = sum( k=0..n, C(k) ) (mod 3), where C(k) = binomial(2k,k)/(k+1).
|
|
|
PROG
|
(PARI) A137992(n) = lift( sum( k=0, n, binomial( 2*k, k )/(k+1), Mod(0, 3) ))
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
