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.

A215015 Number of sphenic twins up to 10^n.

Original entry on oeis.org

0, 0, 11, 337, 4206, 43330, 417479, 3917508, 36358375, 336046778, 3105465308, 28739218426
Offset: 1

Views

Author

Martin Renner, Aug 06 2012

Keywords

Comments

The sphenic twin pairs {230, 231}, {285, 286}, ... are counted once at a time.

Examples

			a(3) = 11 since there are 11 sphenic twins below 10^3 whose smaller members are 230, 285, 429, 434, 609, 645, 741, 805, 902, 969, 986.
		

Crossrefs

Programs

  • Mathematica
    sphQ[n_]:= FactorInteger[n][[;;,2]] == {1, 1, 1}; c = 0; p = 10; q1 = 0; seq = {}; Do[q2 = sphQ[k]; If[q1 && q2, c++]; If[k == p, AppendTo[seq, c]; p*=10]; q1 = q2, {k, 2, 10^5}]; seq (* Amiram Eldar, Dec 26 2019 *)

Extensions

a(8)-a(10) from Amiram Eldar, Dec 26 2019
a(11)-a(12) from Lucas A. Brown, Feb 12 2024