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 A270437 #23 Sep 07 2023 14:03:20 %S A270437 1,8,27,64,125,216,343,32,729,1000,1331,1728,2197,2744,3375,4096,4913, %T A270437 5832,6859,8000,9261,10648,12167,864,15625,17576,243,21952,24389, %U A270437 27000,29791,32768,35937,39304,42875,46656,50653,54872,59319,4000,68921,74088,79507,85184,91125,97336,103823,110592,117649,125000 %N A270437 Multiplicative with a(p^e) = p^(e XOR 2e), where XOR is bitwise-xor. %C A270437 Multiplicative with a(p^e) = p^A048724(e), where A048724(e) = (e XOR 2e). %C A270437 Multiples of 8 in the ring defined in A329329. - _Peter Munn_, Jan 17 2020 %H A270437 Antti Karttunen, <a href="/A270437/b270437.txt">Table of n, a(n) for n = 1..12167</a> %F A270437 a(1) = 1, for n > 1, a(n) = A020639(n)^A048724(A067029(n)) * a(A028234(n)). %F A270437 Other identities. For all n >= 1: %F A270437 A270418(a(n)) = 1, A270419(a(n)) = n. %F A270437 a(n) = A329329(n,8) = A329329(8,n). - _Peter Munn_, Jan 17 2020 %t A270437 f[p_, e_] := p^BitXor[2*e, e]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* _Amiram Eldar_, Sep 07 2023 *) %o A270437 (Scheme, with memoization-macro definec) %o A270437 (definec (A270437 n) (cond ((= 1 n) 1) (else (* (expt (A020639 n) (A048724 (A067029 n))) (A270437 (A028234 n)))))) %Y A270437 Cf. A020639, A028234, A048724, A067029. %Y A270437 Cf. A262675 (same sequence sorted into ascending order). %Y A270437 Cf. also A270418, A270419, A270436 and permutation A273671. %Y A270437 Row 8 and column 8 of A329329. %K A270437 nonn,easy,mult %O A270437 1,2 %A A270437 _Antti Karttunen_, May 27 2016 %E A270437 Name changed by _Antti Karttunen_, Sep 07 2023