Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064910 Smallest semiprime p1*p2 such that p2 mod p1 = n. +0
3
4, 6, 15, 65, 77, 133, 91, 319, 209, 341, 299, 481, 493, 799, 527, 1007, 1139, 2449, 703, 3611, 989, 1541, 1643, 3589, 1537, 2407, 2747, 2759, 1829, 3811, 1891, 4633, 2993, 3959, 2627, 4033, 2701, 6157, 3239, 9073, 3569, 5461, 4183, 6439, 5141, 6533 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Cf. A001358 (p2 mod p1 = 0), A064899-A064909, A064911, A053409, A046413.

Sequence in context: A034299 A007135 A073603 this_sequence A086714 A009463 A066260

Adjacent sequences: A064907 A064908 A064909 this_sequence A064911 A064912 A064913

KEYWORD

nonn

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Oct 13 2001.

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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research