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.

A337022 a(n) is the number of positive integers <= A070826(n) with at least one odd prime divisor <= prime(n).

This page as a plain text file.
%I A337022 #63 Aug 24 2021 20:17:12
%S A337022 0,1,7,57,675,9255,163095,3190965,75051075,2212976535,69624142665,
%T A337022 2606749381005,107980344307605,4687299592683015,222157161929253705,
%U A337022 11859617311615438365,704152383312290447535,43210523173814533171635,2910538720151462674819545,207666871186142520765307695
%N A337022 a(n) is the number of positive integers <= A070826(n) with at least one odd prime divisor <= prime(n).
%C A337022 The set of finite differences positive numbers up to A070826(n) with at least one odd prime divisor <= prime(n) is a palindromic set.
%F A337022 a(n+1) = (prime(n+1) - 1)*a(n) + A070826(n). - _Jinyuan Wang_, Aug 11 2020
%F A337022 a(n) = A002110(n)/2 - A005867(n). - _Jamie Morken_, Aug 11 2021
%e A337022 a(3) = 7, p = {3, 5}, prime(n)# / 2 = 15, {3, 5, 6, 9, 10, 12, 15} - divisible by 3 or 5.
%o A337022 (PARI) pm=1; forprime(p=2,19,pm*=p; my(k=0); for(x=2,pm/2, forprime(q=3,p, if(x%q==0,k++;break))); print1(k,", ")) \\ _Hugo Pfoertner_, Aug 11 2020
%Y A337022 Cf. A002110, A070826, A005867.
%K A337022 nonn
%O A337022 1,3
%A A337022 _Zhandos Mambetaliyev_, Aug 11 2020
%E A337022 a(8)-a(10) from _Hugo Pfoertner_, Aug 11 2020
%E A337022 More terms from _Jinyuan Wang_, Aug 11 2020