|
|
A066207
|
|
All primes that divide n are of the form prime(2k), where prime(k) is k-th prime.
|
|
64
|
|
|
1, 3, 7, 9, 13, 19, 21, 27, 29, 37, 39, 43, 49, 53, 57, 61, 63, 71, 79, 81, 87, 89, 91, 101, 107, 111, 113, 117, 129, 131, 133, 139, 147, 151, 159, 163, 169, 171, 173, 181, 183, 189, 193, 199, 203, 213, 223, 229, 237, 239, 243, 247, 251, 259, 261, 263, 267, 271, 273
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The partitions into even parts, encoded by their Heinz numbers. We define the Heinz number of a partition p = [p_1, p_2, ..., p_r] as Product(p_j-th prime, j=1..r) (concept used by Alois P. Heinz in A215366 as an "encoding" of a partition). For example, for the partition [1, 1, 2, 4, 10] we get 2*2*3*7*29 = 2436. Example: 63 ( = 3*3*7) is in the sequence because it is the Heinz number of the partition [2, 2, 4]. - Emeric Deutsch, May 19 2015
For every positive integer m there exists a unique ordered pair of positive integers (j,k) such that m = a(j)*A066208(k). - Christopher Scussel, Jul 01 2023
|
|
LINKS
|
|
|
EXAMPLE
|
39 is included because 3 * 13 = prime(2) * prime(6) and 2 and 6 are both even.
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) { n=0; for (m=2, 10^9, f=factor(m); b=1; for(i=1, matsize(f)[1], if (primepi(f[i, 1])%2, b=0; break)); if (b, write("b066207.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Feb 06 2010
(PARI) isA066207(n) = (!#select(p -> (primepi(p)%2), factor(n)[, 1])); \\ Antti Karttunen, Jul 18 2020
|
|
CROSSREFS
|
Numbers in the odd bisection of A336321.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(1) = 1 inserted (and the indexing of the rest of terms changed) by Antti Karttunen, Jul 18 2020
|
|
STATUS
|
approved
|
|
|
|