login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088917 Central Delannoy numbers (mod 3). 1
1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Also Apery numbers (mod 3). More generally also sum(k=0,n,binomial(n,k)^x*binomial(n+k,k)^y) (mod 3) for any x>=1 in N and any odd y>=1.

LINKS

Eric Weisstein's World of Mathematics, Cantor Fractal

FORMULA

a(A005823(n))=1; a(A081606(n))=0

a(n)=A001850(n)-3*floor(A001850(n)/3)

MATHEMATICA

Nest[ Flatten[# /. {0 -> {0, 0, 0}, 1 -> {1, 0, 1}}] &, {1}, 5] (* Or *)

f[n_] := Mod[LegendreP[n, 3], 3]; Array[f, 111, 0] (* Or *)

f[n_] := If[ FreeQ[ IntegerDigits[n, 3], 1], 1, 0]; Array[f, 111, 0] (* Robert G. Wilson v, Jun 16 2011 *)

PROG

(PARI) a(n)=sum(k=0, n, binomial(n, k)*binomial(n+k, k))%3

CROSSREFS

Cf. A005823, A005258, A081606, A001850.

Sequence in context: A102242 A005369 A108340 * A014933 A011643 A015941

Adjacent sequences:  A088914 A088915 A088916 * A088918 A088919 A088920

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 30 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.