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.

A324540 Numbers not in range of A324580.

This page as a plain text file.
%I A324540 #11 Mar 10 2019 19:31:42
%S A324540 1,3,4,5,7,8,9,10,11,12,13,14,15,16,17,19,20,21,22,23,24,25,26,27,28,
%T A324540 29,31,32,33,34,35,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,
%U A324540 54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,91
%N A324540 Numbers not in range of A324580.
%C A324540 Positions of zeros in A324539.
%H A324540 Antti Karttunen, <a href="/A324540/b324540.txt">Table of n, a(n) for n = 1..19955</a>
%H A324540 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324540 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%o A324540 (PARI)
%o A324540 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324540 A324539(n) = sumdiv(n,d,(d==A276086(n/d)));
%o A324540 for(n=1,100,if(0==A324539(n), print1(n, ", ")));
%o A324540 (PARI)
%o A324540 search_limit = 15000;
%o A324540 A324580(n) = n*A276086(n);
%o A324540 A324540list(search_up_to) = { my(v=vector(search_up_to),c=0,k); for(n=1,#v,k=A324580(n); if(k<=#v && !v[k], v[k] = n; c++)); my(u=vector(#v-c), j=0); for(n=1,#v,if(0==v[n], j++; u[j] = n)); (u); };
%o A324540 v324540 = A324540list(search_limit);
%o A324540 A324540(n) = v324540[n];
%Y A324540 Cf. A324541 (complement).
%Y A324540 Cf. A276086, A324539, A324580, A065091 (a subsequence).
%K A324540 nonn
%O A324540 1,2
%A A324540 _Antti Karttunen_, Mar 10 2019