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.

A331293 Let h = A061395(n) and u = A108951(n) - (A002110(h)*A329348(n)). Then a(n) = u/A002110(1+h).

This page as a plain text file.
%I A331293 #12 Jan 17 2020 17:40:30
%S A331293 0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,2,0,2,0,0,0,0,0,1,4,0,7,0,0,1,0,5,0,0,
%T A331293 2,4,0,0,0,1,0,1,0,0,5,0,0,3,19,8,0,0,0,14,2,0,0,0,0,3,0,0,3,10,1,0,0,
%U A331293 0,0,5,0,9,0,0,25,0,16,0,0,2,43,0,0,2,1,0,0,0,0,10,12,0,0,0,1,6,0,38,2,17,0,0,0,0,16
%N A331293 Let h = A061395(n) and u = A108951(n) - (A002110(h)*A329348(n)). Then a(n) = u/A002110(1+h).
%H A331293 Antti Karttunen, <a href="/A331293/b331293.txt">Table of n, a(n) for n = 1..10201</a>
%H A331293 Antti Karttunen, <a href="/A331293/a331293.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A331293 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A331293 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A331293 a(n) modulo A151800(A117366(n)) = A331292(n).
%o A331293 (PARI) A331293(n) = { my(h=A061395(n), u = A108951(n) - (A002110(h)*(A331188(n)%prime(1+h)))); (u/A002110(1+h)); };
%Y A331293 Cf. A002110, A061395, A108951, A329348, A331188, A331292.
%Y A331293 Cf. A331294 (positions of records).
%K A331293 nonn
%O A331293 1,16
%A A331293 _Antti Karttunen_, Jan 17 2020