login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174617 Number of nine-prime Carmichael numbers less than 10^n. 5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 27, 170, 1436, 8835, 44993, 196391, 762963, 2714473 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,15

LINKS

Table of n, a(n) for n=0..21.

R. G. E. Pinch, "The Carmichael numbers up to 10^21", Proceedings of Conference on Algorithmic Number Theory 2007

EXAMPLE

n=13, with 9 prime factors, the smallest Carmichael number is : 9746347772161 = 7*11*13*17*19*31*37*41*641.

CROSSREFS

Cf. A002997, A132195, A006931, A055553, A174612 - A174616.

Sequence in context: A042418 A042420 A213285 * A055339 A269054 A248234

Adjacent sequences:  A174614 A174615 A174616 * A174618 A174619 A174620

KEYWORD

nonn

AUTHOR

Michel Lagneau, Mar 23 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 13:07 EST 2016. Contains 278875 sequences.