Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135720
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135720 a(n) = smallest Carmichael numbers A002997 with (n+1)-st prime as smallest divisor. +0
5
561, 1729, 75361, 29341, 162401, 334153, 1615681, 3581761, 399001, 252601, 1152271 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 561 because smallest prime divisor 3 is second prime.

CROSSREFS

Cf. A002997, A135717, A006931, A135719.

Sequence in context: A048123 A131672 A083732 this_sequence A097130 A110889 A063400

Adjacent sequences: A135717 A135718 A135719 this_sequence A135721 A135722 A135723

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 25 2007

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research