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.

A083532 First difference sequence of A007369. Differences between impossible values for sum of divisors of n.

Original entry on oeis.org

3, 4, 1, 1, 5, 1, 2, 2, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 4, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 3, 1, 2, 4, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 1
Offset: 1

Views

Author

Labos Elemer, May 20 2003

Keywords

Examples

			29 and 33 are the 15th and 16th nonsense values for sigma(x), since there exist no numbers n of which they are sums of divisors, while {30,31,32} equal sigma(x); e.g., for x = 29, 16, 31, respectively, thus 33 - 29 = 4 = a(15) = A007369(16) - A007369(15).
		

Crossrefs

Programs

  • Mathematica
    t0[x_] := Table[j, {j, 1, x}]; t=Table[DivisorSigma[1, w], {w, 1, 25000}]; u=Union[%]; c=Complement[t0[25000], u]; Delete[c-RotateRight[c], 1]

Formula

a(n) = A007369(n+1) - A007369(n).

A083535 A version of the Chebyshev function theta(n): a(n) = ceiling(Sum_{primes p <= n } log(p)).

Original entry on oeis.org

0, 1, 2, 2, 4, 4, 6, 6, 6, 6, 8, 8, 11, 11, 11, 11, 14, 14, 17, 17, 17, 17, 20, 20, 20, 20, 20, 20, 23, 23, 27, 27, 27, 27, 27, 27, 30, 30, 30, 30, 34, 34, 38, 38, 38, 38, 41, 41, 41, 41, 41, 41, 45, 45, 45, 45, 45, 45, 50, 50, 54, 54, 54, 54, 54, 54, 58, 58, 58, 58, 62, 62, 66, 66, 66, 66
Offset: 1

Views

Author

N. J. A. Sloane, Oct 02 2008

Keywords

Comments

See A035158, which is the main entry for this function.
The old entry with this sequence number was a duplicate of A083235.

Formula

a(n) ~ n by the prime number theorem. - Charles R Greathouse IV, Aug 02 2012
Showing 1-2 of 2 results.