Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067783
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067783 Numbers n such that prime(n+1)^2=prime(n)^2 (mod n). +0
1
1, 2, 3, 4, 6, 8, 10, 12, 15, 16, 24, 30, 56, 92, 120, 144, 182, 336, 344, 348, 360, 376, 439, 1058, 1407, 4122, 5432, 7040, 7904, 9516, 17400, 23898, 25356, 29721, 33840, 40086, 40090, 40114, 40120 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A067780 A067781 A067782 this_sequence A067784 A067785 A067786

Sequence in context: A064375 A037229 A007183 this_sequence A062418 A056168 A019293

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 06 2002

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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research