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 A331291 #9 Jan 15 2020 18:40:27 %S A331291 1,1,1,4,1,4,1,3,2,4,1,12,1,4,12,8,1,6,1,12,12,4,1,12,4,4,3,12,1,15,1, %T A331291 5,12,4,16,16,1,4,12,4,1,3,1,12,3,4,1,5,2,12,12,12,1,8,8,32,12,4,1,12, %U A331291 1,4,9,12,26,36,1,12,12,15,1,15,1,4,15,12,4,36,1,10,4,4,1,8,22,4,12,32,1,8,12,12,12,4 %N A331291 a(n) = A001222(n) * A329348(n). %C A331291 Records occur at n = 1, 4, 12, 30, 35, 56, 66, 132, 145, 208, 276, 279, 469, ... %H A331291 Antti Karttunen, <a href="/A331291/b331291.txt">Table of n, a(n) for n = 1..12571</a> %H A331291 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A331291 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %H A331291 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a> %F A331291 a(n) = A001222(n) * A329348(n) = A001222(n) * (A331188(n) mod A117366(n)). %F A331291 a(p) = 1 for all primes p. %o A331291 (PARI) %o A331291 A002110(n) = prod(i=1, n, prime(i)); %o A331291 A331291(n) = if(1==n, 1, my(f=factor(n), p=nextprime(1+vecmax(f[, 1]))); ((prod(i=1, #f~, A002110(primepi(f[i, 1]))^(f[i, 2]-(#f~==i)))%p)*bigomega(n))); %Y A331291 Cf. A001222, A117366, A329348, A331188, A331289, A331290. %K A331291 nonn,less %O A331291 1,4 %A A331291 _Antti Karttunen_, Jan 15 2020