Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022461
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022461 a(n) = p(n+1)*p(n+2) mod p(n). +0
2
1, 2, 2, 3, 1, 11, 12, 2, 2, 16, 29, 24, 12, 40, 25, 48, 16, 60, 24, 16, 60, 40, 1, 7, 24, 12, 24, 12, 72, 26, 40, 48, 24, 120, 16, 72, 60, 40, 72, 48, 24, 120, 12, 24, 28, 89, 192, 24, 12, 40, 48, 24, 160, 72, 72, 48, 16, 60, 24, 24, 240, 252, 24, 12, 72, 280 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Table[Mod[Prime[n + 1]Prime[n + 2], Prime[n]], {n, 1, 80}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 14 2006

CROSSREFS

Equals A072565(n) - 1.

Sequence in context: A028507 A096226 A016539 this_sequence A007906 A098008 A127638

Adjacent sequences: A022458 A022459 A022460 this_sequence A022462 A022463 A022464

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.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 August 29 14:50 EDT 2008. Contains 143238 sequences.


AT&T Labs Research