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.

A318992 Numbers whose consecutive prime indices are not all divisible.

This page as a plain text file.
%I A318992 #9 Oct 27 2018 01:07:56
%S A318992 15,30,33,35,45,51,55,60,66,69,70,75,77,85,90,91,93,95,99,102,105,110,
%T A318992 119,120,123,132,135,138,140,141,143,145,150,153,154,155,161,165,170,
%U A318992 175,177,180,182,186,187,190,195,198,201,203,204,205,207,209,210,215
%N A318992 Numbers whose consecutive prime indices are not all divisible.
%H A318992 Andrew Howroyd, <a href="/A318992/b318992.txt">Table of n, a(n) for n = 1..10000</a>
%e A318992 The sequence of partitions whose Heinz numbers belong to the sequence begins: (3,2), (3,2,1), (5,2), (4,3), (3,2,2), (7,2), (5,3), (3,2,1,1), (5,2,1), (9,2), (4,3,1), (3,3,2), (5,4), (7,3), (3,2,2,1), (6,4), (11,2), (8,3), (5,2,2).
%t A318992 Select[Range[100],!Or[#==1,PrimePowerQ[#],Divisible@@Reverse[PrimePi/@FactorInteger[#][[All,1]]]]&]
%o A318992 (PARI) ok(n)={my(v=apply(primepi, factor(n)[,1])); for(i=2, #v, if(v[i]%v[i-1], return(1))); 0} \\ _Andrew Howroyd_, Oct 26 2018
%Y A318992 Cf. A000040, A001221, A001222, A008480, A289509, A300912, A318990, A318991, A318993.
%K A318992 nonn
%O A318992 1,1
%A A318992 _Gus Wiseman_, Sep 06 2018