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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033326 [ 6/n ]. 0
6, 3, 2, 1, 1, 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, 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, 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, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n)=6*[C(2*n,n) mod 2]+3*{C[(n+1)^2,n+3] mod 2}+2*[C(n^2,n+2) mod 2]+{C[(n+11)^4,n+13] mod 2}+{C[(n+10)^4,n+12] mod 2}+{C[(n+9)^4,n+11] mod 2} - Paolo P. Lava (paoloplava(AT)gmail.com), Jan 07 2008

CROSSREFS

Sequence in context: A108451 A122178 A126445 * A068996 A068924 A106224

Adjacent sequences:  A033323 A033324 A033325 * A033327 A033328 A033329

KEYWORD

easy,nonn

AUTHOR

Jeff Burch (jmburch(AT)osprey.smcm.edu)

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 14 09:50 EST 2012. Contains 205614 sequences.