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.

A328843 a(n) = A328841(A276086(n)).

This page as a plain text file.
%I A328843 #6 Nov 01 2019 18:40:08
%S A328843 1,2,3,6,9,6,3,8,9,30,39,30,7,38,39,30,219,240,33,248,249,240,249,240,
%T A328843 247,248,249,2550,2559,2550,7,8,9,36,33,36,33,38,39,210,249,210,37,
%U A328843 248,249,210,249,2520,243,248,2559,2520,2559,2520,2557,2558,2559,2520,32379,32550,37,38,39,246,219,246,243,248,249,210,249,2520,247
%N A328843 a(n) = A328841(A276086(n)).
%H A328843 Antti Karttunen, <a href="/A328843/b328843.txt">Table of n, a(n) for n = 0..32768</a>
%H A328843 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328843 a(n) = A328841(A276086(n)).
%F A328843 a(n) = A276086(n) - A328844(n).
%F A328843 For all n >= 0, A257993(a(n)) = A328570(n).
%o A328843 (PARI)
%o A328843 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328843 A328841(n) = { my(p=2, r=1, s=0); while(n, s += ((!!(n%p))*r); r *= p; n = n\p; p = nextprime(1+p)); (s); };
%o A328843 A328843(n) = A328841(A276086(n));
%Y A328843 Cf. A257993, A276086, A328570, A328841, A328844.
%K A328843 nonn
%O A328843 0,2
%A A328843 _Antti Karttunen_, Oct 30 2019