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.

A096519 Solutions to A096509[x]=8, the number of prime-powers [including primes] in neighborhood of x with Ceiling[Log[x]] radius, equals 8.

Original entry on oeis.org

284736, 595953, 855723, 855725, 855726, 855727, 1146785, 1146786, 1146787, 1616612, 1616618, 1616624, 1652884, 1654028, 1718708, 1749272, 1954358, 2176624, 2580658, 2580659, 2580660, 2580661, 2580662, 2831672, 2839942
Offset: 1

Views

Author

Labos Elemer, Jul 12 2004

Keywords

Crossrefs

A096821 Solutions to Mod[sigma(x),x]=12 of the form p*(p+13)/2 where p is a prime of form=2^j-13, of which j exponents are listed in A096818.

Original entry on oeis.org

24, 304, 127744, 33501184, 8589082624, 10384593717069654320312270165377024, 822752278660603021077484591278411581166520461101278617407586304, 15177100720513508366558296147058741458142670970377727126573378340391656803557965824
Offset: 1

Views

Author

Labos Elemer, Jul 13 2004

Keywords

Comments

The relevant A084306 includes additional solution like 21, while A076496 contains solutions of 6k form too.

Examples

			8th term is (2^136)*(-13+2^137) with 83 decimal digits; n=4: a[4]=(2^3)*(16-13)=24;
		

Crossrefs

Showing 1-2 of 2 results.