|
| |
|
|
A297002
|
|
Completely multiplicative with a(prime(k)) = prime(2 * k) (where prime(k) denotes the k-th prime).
|
|
11
|
|
|
|
1, 3, 7, 9, 13, 21, 19, 27, 49, 39, 29, 63, 37, 57, 91, 81, 43, 147, 53, 117, 133, 87, 61, 189, 169, 111, 343, 171, 71, 273, 79, 243, 203, 129, 247, 441, 89, 159, 259, 351, 101, 399, 107, 261, 637, 183, 113, 567, 361, 507, 301, 333, 131, 1029, 377, 513, 371
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
This sequence is a permutation of {1} union A066207.
This sequence is the third row of A248601.
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = A248601(3, n) for any n > 0.
|
|
|
MATHEMATICA
|
Array[Times @@ Map[Power @@ # &, FactorInteger[#] /. {p_, e_} /; p > 1 :> {Prime[2 PrimePi@ p], e}] &, 57] (* Michael De Vlieger, Dec 23 2017 *)
|
|
|
PROG
|
(PARI) a(n) = my (f=factor(n)); prod(i=1, #f~, prime(2 * primepi(f[i, 1]))^f[i, 2])
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn,mult
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
