Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A065511
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A065511
Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.
+0
1
1, 92, 105, 106, 689, 1138, 1280, 1373, 1432, 1600, 1960, 2416, 2683, 2846, 2968, 3042, 3091, 4694, 4884, 5191, 5284, 5642, 6905, 6949, 7074, 7095, 7213, 7274, 7418
(
list
;
graph
;
listen
)
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 8 08:31 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
