Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158851 a(n) = LCM(1,2,3,...,n) (mod(n+1)). +0
1
1, 2, 2, 2, 0, 4, 4, 3, 0, 1, 0, 4, 0, 0, 8, 5, 0, 14, 0, 0, 0, 15, 0, 5, 0, 18, 0, 1, 0, 20, 16, 0, 0, 0, 0, 2, 0, 0, 0, 15, 0, 15, 0, 0, 0, 8, 0, 21, 0, 0, 0, 29, 0, 0, 0, 0, 0, 21, 0, 16, 0, 0, 32, 0, 0, 29, 0, 0, 0, 23, 0, 22, 0, 0, 0, 0, 0, 30, 0, 54, 0, 71, 0, 0, 0, 0, 0, 37, 0, 0, 0, 0, 0, 0, 0, 7, 0 (list; graph; listen)
page 1

Search completed in 0.001 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research