Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

FORMULA

a(n)=2*{1-[(n+2) mod (n+1)]}+[n!^2 mod (n+1)]*[(n+1)!^2 mod (n+2)] - Paolo P. Lava (ppl(AT)spl.at), Aug 29 2007

CROSSREFS

Sequence in context: A152137 A060838 A097470 this_sequence A130713 A085857 A056620

Adjacent sequences: A033319 A033320 A033321 this_sequence A033323 A033324 A033325

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 December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research