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 A369648 #15 Feb 04 2024 08:58:19
%S A369648 1,2,6,7,10,24,90,144,766,1040,1164,2122,3010,8914,17838,20500,87472,
%T A369648 243252,312058,1118346,1347998,2167146,3569780,6038946
%N A369648 Indices of novel terms in A351073, where A351073 is the maximal exponent in the prime factorization of the numbers that are sums of distinct primorial numbers.
%C A369648 Indices k at which A351073(k) for the first time attains a new distinct value.
%H A369648 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A369648 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%e A369648 See examples in A369649.
%o A369648 (PARI)
%o A369648 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A369648 A276156(n) = { my(s=0, p=1, r=1); while(n, if(n%2, s += r); n>>=1; p = nextprime(1+p); r *= p); (s); };
%o A369648 A351073(n) = A051903(A276156(n));
%o A369648 m=Map(); for(n=1,2^25,e=A351073(n);if(!mapisdefined(m,e),mapput(m,e,n);print1(n,", ")));
%Y A369648 Cf. A002110, A051903, A276156, A351073, A369649 (corresponding values of A276156).
%Y A369648 Cf. also A369647.
%K A369648 nonn,hard,more
%O A369648 1,2
%A A369648 _Antti Karttunen_, Feb 03 2024