Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033328
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033328 [ 8/n ]. +0
1
8, 4, 2, 2, 1, 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 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=8*[C(2*n,n) mod 2]+4*{C[(n+1)^2,n+3] mod 2}+2*[C(n^2,n+2) mod 2]+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}+{C[(n+8)^4,n+10] mod 2}+{C[(n+7)^4,n+9] mod 2} - Paolo P. Lava (ppl(AT)spl.at), Jan 07 2008

CROSSREFS

Sequence in context: A080828 A131916 A131606 this_sequence A097529 A114321 A154434

Adjacent sequences: A033325 A033326 A033327 this_sequence A033329 A033330 A033331

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research