|
Search: id:A102615
|
|
|
| A102615 |
|
Nonprime numbers of order 2. |
|
+0
3
|
|
| 1, 8, 10, 14, 15, 16, 20, 22, 24, 25, 27, 30, 32, 33, 35, 36, 38, 39, 40, 44, 46, 48, 49, 50, 51, 54, 55, 56, 58, 62, 63, 64, 66, 68, 69, 70, 72, 75, 76, 77, 78, 80, 82, 85, 86, 87, 88, 90, 92, 93, 94, 96, 99, 100, 102, 104, 105, 108, 110, 111, 114, 115, 116, 117, 118, 120
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
nps(n,0) -> list nonprime(n) or the sequence of nonprime numbers. nps(n,1) -> list nonprime(nonprime(n)) or nps of order 1 nps(n,2) -> list nonprime(nonprime(nonprime(n))) or nps of order 2 ..... The order is the number of nestings - 1. We avoid the nestings in the script with a loop.
|
|
EXAMPLE
|
Nonprime(2) = 4.
Nonprime(4) = 8 the second entry.
|
|
MATHEMATICA
|
nonPrime[n_] := FixedPoint[n + PrimePi[ # ] &, n]; Nest[nonPrime, Range[66], 2] (from Robert G. Wilson v Feb 04 2005)
|
|
PROGRAM
|
(PARI) \We perform nesting(s) with a loop. cics(n, m) = { local(x, y, z); for(x=1, n, z=x; for(y=1, m+1, z=composite(z); ); print1(z", ") ) } composite(n) = \ The n-th composite number. 1 is defined as a composite number. { local(c, x); c=1; x=0; while(c <= n, x++; if(!isprime(x), c++); ); return(x) }
|
|
CROSSREFS
|
Cf. A018252.
Sequence in context: A010916 A101764 A048591 this_sequence A030490 A076639 A100319
Adjacent sequences: A102612 A102613 A102614 this_sequence A102616 A102617 A102618
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jan 31 2005
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 04 2005
|
|
|
Search completed in 0.002 seconds
|
