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 A270436 #12 Aug 13 2023 02:17:32 %S A270436 1,2,3,4,5,6,7,128,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,384,25, %T A270436 26,2187,28,29,30,31,8192,33,34,35,36,37,38,39,640,41,42,43,44,45,46, %U A270436 47,48,49,50,51,52,53,4374,55,896,57,58,59,60,61,62,63,16384,65,66,67,68,69,70,71,1152,73,74,75 %N A270436 a(1) = 1, for n > 1, a(n) = A020639(n)^A065621(A067029(n)) * a(A028234(n)). %H A270436 Antti Karttunen, <a href="/A270436/b270436.txt">Table of n, a(n) for n = 1..12167</a> %F A270436 Multiplicative with a(p^e) = p^A065621(e). %F A270436 a(1) = 1, for n > 1, a(n) = A020639(n)^A065621(A067029(n)) * a(A028234(n)). %F A270436 Other identities. For all n >= 1: %F A270436 A270418(a(n)) = n, A270419(a(n)) = 1. %t A270436 f[p_, e_] := p^BitXor[e - 1, 2*e - 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Aug 13 2023 *) %o A270436 (Scheme, with memoization-macro definec) %o A270436 (definec (A270436 n) (cond ((= 1 n) 1) (else (* (expt (A020639 n) (A065621 (A067029 n))) (A270436 (A028234 n)))))) %Y A270436 Cf. A020639, A028234, A065621, A067029. %Y A270436 Cf. A270428 (same sequence sorted into ascending order). %Y A270436 Cf. also A270418, A270419, A270437 and permutation A273671. %K A270436 nonn,mult %O A270436 1,2 %A A270436 _Antti Karttunen_, May 27 2016