Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084316
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084316 a(n) is the smallest number x such that GCD[p(x)+1,x+1]=n, where p(j) is the j*th prime. +0
8
1, 3, 20, 11, 24, 5, 6, 39, 98, 29, 120, 23, 64, 13, 104, 15, 1716, 323, 284, 499, 62, 1099, 1264, 215, 1274, 51, 512, 447, 1768, 209, 1332, 31, 32, 373, 34, 1475, 258, 835, 2300, 519, 5780, 419, 5374, 1275, 6974, 1655, 6626, 479, 10240, 10549, 3008, 883, 13938 (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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research