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.

Showing 1-2 of 2 results.

A263091 Primes p for which A049820(x) = p has no solution.

Original entry on oeis.org

7, 13, 19, 37, 43, 67, 79, 103, 109, 113, 131, 163, 167, 193, 229, 241, 251, 257, 271, 293, 307, 313, 353, 359, 379, 383, 397, 401, 439, 463, 479, 487, 491, 499, 503, 509, 563, 571, 647, 653, 661, 673, 701, 739, 743, 757, 761, 773, 823, 859, 863, 883, 887, 911, 937, 941, 953, 967, 971, 977, 983, 1009, 1093, 1103, 1109, 1171, 1181, 1193, 1217, 1279, 1283, 1291, 1297, 1307, 1321, 1361
Offset: 1

Views

Author

Antti Karttunen, Oct 11 2015

Keywords

Comments

Primes p that there is no such k for which k - d(k) = p, where d(k) is the number of divisors of k (A000005).

Crossrefs

Complement among primes: A263090.
Intersection of A000040 and A045765.
Subsequence of A067774 (A049591).

Programs

  • Mathematica
    lim = 10000; s = Select[Complement[Range@ lim, Sort@ DeleteDuplicates@ Table[n - DivisorSigma[0, n], {n, lim}]], PrimeQ]; Take[s, 76] (* Michael De Vlieger, Oct 13 2015 *)
  • PARI
    allocatemem(123456789);
    uplim1 = 2162160 + 320; \\ = A002182(41) + A002183(41).
    v060990 = vector(uplim1);
    for(n=3, uplim1, v060990[n-numdiv(n)]++);
    A060990 = n -> if(!n,2,v060990[n]);
    n=0; forprime(p=2, 524287, if((0 == A060990(p)), n++; write("b263091.txt", n, " ", p)));
    
  • Scheme
    ;; With Antti Karttunen's IntSeq-library.
    (define A263091 (MATCHING-POS 1 1 (lambda (n) (and (= 1 (A010051 n)) (zero? (A060990 n))))))

A263094 Squares in A236562; numbers n^2 such that there is at least one such k for which k - d(k) = n^2, where d(k) is the number of divisors of k (A000005).

Original entry on oeis.org

0, 1, 4, 9, 16, 81, 121, 144, 169, 225, 289, 361, 441, 529, 576, 625, 841, 900, 961, 1024, 1089, 1296, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2304, 2401, 2601, 2704, 2809, 3025, 3249, 3721, 3969, 4096, 4225, 4356, 4624, 4761, 4900, 5041, 5184, 5476, 5625, 5776, 5929, 6241, 6400, 6561, 6889, 7056, 7396, 7569, 7744, 8281, 8464, 8649, 9216, 9409, 9801, 10201, 10404, 11025
Offset: 0

Views

Author

Antti Karttunen, Oct 11 2015

Keywords

Comments

Starting offset is zero, because a(0)=0 is a special case in this sequence.

Crossrefs

Intersection of A000290 and A236562.
Cf. A263092 (gives the square roots of these terms).
Cf. A263095 (complement among squares).
Cf. A262514 (a subsequence).
Cf. also A263090, A263098.

Programs

  • Mathematica
    Take[Select[Sort@ DeleteDuplicates@ Table[n - DivisorSigma[0, n], {n, 20000}], IntegerQ@ Sqrt@ # &], 68] (* Michael De Vlieger, Oct 13 2015 *)
  • PARI
    \\ See code in A263092.
    
  • Scheme
    (define (A263094 n) (A000290 (A263092 n)))

Formula

a(n) = A000290(A263092(n)).
Showing 1-2 of 2 results.