cp's OEIS Frontend

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.

A348949 a(n) = A003959(A276086(n)), where A003959 is multiplicative with a(p^e) = (p+1)^e, and A276086 gives the prime product form of primorial base expansion of n.

This page as a plain text file.
%I A348949 #12 Feb 11 2022 11:24:08
%S A348949 1,3,4,12,16,48,6,18,24,72,96,288,36,108,144,432,576,1728,216,648,864,
%T A348949 2592,3456,10368,1296,3888,5184,15552,20736,62208,8,24,32,96,128,384,
%U A348949 48,144,192,576,768,2304,288,864,1152,3456,4608,13824,1728,5184,6912,20736,27648,82944,10368,31104,41472,124416,165888,497664,64
%N A348949 a(n) = A003959(A276086(n)), where A003959 is multiplicative with a(p^e) = (p+1)^e, and A276086 gives the prime product form of primorial base expansion of n.
%H A348949 Antti Karttunen, <a href="/A348949/b348949.txt">Table of n, a(n) for n = 0..11550</a>
%H A348949 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A348949 a(n) = A003959(A276086(n)).
%F A348949 a(n) = A276086(n) + A348950(n).
%o A348949 (PARI) A348949(n) = { my(m=1, p=2); while(n, m *= ((1+p)^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%Y A348949 Cf. A003959, A276086, A348950, A348997, A348999.
%Y A348949 Cf. also A324653, A346470, A348996.
%K A348949 nonn,base,easy
%O A348949 0,2
%A A348949 _Antti Karttunen_, Nov 07 2021