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.

A276184 Numbers n such that A276183(n) = 1.

Original entry on oeis.org

22, 28, 30, 33, 34, 37, 38, 40, 43, 44, 45, 48, 51, 53, 54, 55, 56, 61, 63, 64, 65, 75, 79, 81, 83, 89, 95, 101, 119, 131
Offset: 1

Views

Author

Gheorghe Coserea, Oct 22 2016

Keywords

Crossrefs

Cf. A276183.

Programs

  • PARI
    A000003(n) = qfbclassno(-4*n);
    A000089(n) = {
      if (n%4 == 0 || n%4 == 3, return(0));
      if (n%2 == 0, n \= 2);
      my(f = factor(n), fsz = matsize(f)[1]);
      prod(k = 1, fsz, if (f[k, 1] % 4 == 3, 0, 2));
    };
    A000086(n) = {
      if (n%9 == 0 || n%3 == 2, return(0));
      if (n%3 == 0, n \= 3);
      my(f = factor(n), fsz = matsize(f)[1]);
      prod(k = 1, fsz, if (f[k, 1] % 3 == 2, 0, 2));
    };
    A001615(n) = {
      my(f = factor(n), fsz = matsize(f)[1],
         g = prod(k=1, fsz, (f[k, 1]+1)),
         h = prod(k=1, fsz, f[k, 1]));
      return((n*g)\h);
    };
    A001616(n) = {
      my(f = factor(n), fsz = matsize(f)[1]);
      prod(k = 1, fsz, f[k, 1]^(f[k, 2]\2) + f[k, 1]^((f[k, 2]-1)\2));
    };
    A001617(n) = 1 + A001615(n)/12 - A000089(n)/4 - A000086(n)/3 - A001616(n)/2;
    A276183(n) = {
      my(r = if (n%8 == 3, 4, n%8 == 7, 6, 3));
      if (n < 5, 0, (1 + A001617(n))/2 -  r * A000003(n)/12);
    };
    Vec(select(x->x==1, vector(5000, n, A276183(n)), 1))