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.

Original entry on oeis.org

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, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 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
Offset: 1

Views

Author

Antti Karttunen, Mar 10 2019

Keywords

Comments

Positions of zeros in A324539.

Crossrefs

Cf. A324541 (complement).
Cf. A276086, A324539, A324580, A065091 (a subsequence).

Programs

  • PARI
    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; };
    A324539(n) = sumdiv(n,d,(d==A276086(n/d)));
    for(n=1,100,if(0==A324539(n), print1(n, ", ")));
    
  • PARI
    search_limit = 15000;
    A324580(n) = n*A276086(n);
    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); };
    v324540 = A324540list(search_limit);
    A324540(n) = v324540[n];