login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A319525
Completely multiplicative with a(prime(k)) = prime(2*k - 1) (where prime(k) denotes the k-th prime).
4
1, 2, 5, 4, 11, 10, 17, 8, 25, 22, 23, 20, 31, 34, 55, 16, 41, 50, 47, 44, 85, 46, 59, 40, 121, 62, 125, 68, 67, 110, 73, 32, 115, 82, 187, 100, 83, 94, 155, 88, 97, 170, 103, 92, 275, 118, 109, 80, 289, 242, 205, 124, 127, 250, 253, 136, 235, 134, 137, 220
OFFSET
1,2
COMMENTS
This sequence is a permutation of A066208.
See A297002 for a similar sequence.
FORMULA
a(n) = A064989(A297002(n)).
a(n) >= n with equality iff n is a power of 2 (A000079).
PROG
(PARI) a(n) = my (f=factor(n)); prod(i=1, #f~, prime(2*primepi(f[i, 1]) - 1)^f[i, 2])
CROSSREFS
Cf. also A166651.
Sequence in context: A072403 A010078 A074639 * A357983 A338459 A343035
KEYWORD
nonn,mult
AUTHOR
Rémy Sigrist, Sep 22 2018
STATUS
approved