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”).

A328621
Multiplicative with a(p^e) = p^(2e mod p).
2
1, 1, 9, 1, 25, 9, 49, 1, 3, 25, 121, 9, 169, 49, 225, 1, 289, 3, 361, 25, 441, 121, 529, 9, 625, 169, 1, 49, 841, 225, 961, 1, 1089, 289, 1225, 3, 1369, 361, 1521, 25, 1681, 441, 1849, 121, 75, 529, 2209, 9, 2401, 625, 2601, 169, 2809, 1, 3025, 49, 3249, 841, 3481, 225, 3721, 961, 147, 1, 4225, 1089, 4489, 289, 4761, 1225, 5041, 3, 5329
OFFSET
1,3
LINKS
PROG
(PARI) A328621(n) = { my(f = factor(n)); for(k=1, #f~, f[k, 2] = ((2*f[k, 2])%f[k, 1])); factorback(f); };
CROSSREFS
Cf. A011262, A327938, A328618 (a bijective variant).
Sequence in context: A013616 A205381 A237587 * A191871 A181318 A202006
KEYWORD
nonn,mult
AUTHOR
Antti Karttunen, Oct 23 2019
STATUS
approved