This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A328617 #12 Dec 10 2023 17:50:24
%S A328617 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,125,
%T A328617 26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,
%U A328617 2401,250,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,375,76,77,78,79,80,81
%N A328617 Multiplicative with a(p^e) = p^e, if e = 0 mod p, otherwise a(p^e) = p^((p*floor(e/p)) + A124223(A000720(p),e mod p)).
%H A328617 Antti Karttunen, <a href="/A328617/b328617.txt">Table of n, a(n) for n = 1..16384</a>
%H A328617 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A328617 For all n >= 0, A276085(a(A276086(n))) = A289234(n).
%o A328617 (PARI) A328617(n) = { my(f = factor(n), m, q); for(k=1, #f~, q = (f[k, 2]\f[k, 1]); m = (f[k, 2]%f[k, 1]); if(m, f[k, 2] = q*f[k, 1] + lift(1/Mod(m,f[k, 1])))); factorback(f); };
%Y A328617 Cf. A124223, A327938, A289234.
%Y A328617 Cf. also A328618, A328619.
%K A328617 nonn,mult
%O A328617 1,2
%A A328617 _Antti Karttunen_, Oct 23 2019