id:A007011 - OEIS Search Results

Search: id:A007011

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest pseudoprime to base 2 with n prime factors.
(Formerly M5444)

+0
1

341, 561, 11305, 825265, 45593065, 370851481, 38504389105, 7550611589521, 277960972890601, 32918038719446881, 1730865304568301265, 606395069520916762801, 59989606772480422038001, 6149883077429715389052001, 540513705778955131306570201, 35237869211718889547310642241 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`Smallest composite number m with n prime factors such that 2^(m-1)-1 is divisible by m.`
	LINKS	`R. Pinch, Pseudoprimes up to 10^13, Proceedings ANTS-IV, 4th Algorithmic Number Theory Symposium, Leiden, 2000. Springer Lecture Notes in Computer Science 1838 (2000) 459--474.` `Index entries for sequences related to pseudoprimes`
	CROSSREFS	`Cf. A007535.` `Sequence in context: A001567 A006970 A007324 this_sequence A064907 A043685 A043576` `Adjacent sequences: A007008 A007009 A007010 this_sequence A007012 A007013 A007014`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`rgep(AT)chalcedon.demon.co.uk`
	EXTENSIONS	`More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 05 2007`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research