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.

A070258 Smallest of 3 consecutive numbers each divisible by a square.

Original entry on oeis.org

48, 98, 124, 242, 243, 342, 350, 423, 475, 548, 603, 724, 774, 844, 845, 846, 1024, 1250, 1274, 1323, 1375, 1420, 1448, 1519, 1664, 1674, 1680, 1681, 1682, 1848, 1862, 1924, 2007, 2023, 2056, 2106, 2150, 2223, 2275, 2348, 2366, 2523, 2527, 2574, 2644
Offset: 1

Views

Author

Sharon Sela (sharonsela(AT)hotmail.com), May 09 2002

Keywords

Comments

The sequence includes an infinite family of arithmetic progressions. Such AP's can be constructed to each term, with large differences [like e.g. square of primorials, A061742]. It is necessary to solve suitable systems of linear Diophantine equations. E.g.: subsequences of triples of terms = {900a+548, 900a+549, 900a+550} = {4(225f+137), 9(100f+61), 25(36f+22)}; starting terms in this sequence = {548, 1448, 2348, ...}; difference = A002110(3)^2. - Labos Elemer, Nov 25 2002
The numbers of terms not exceeding 10^k, for k = 1, 2, ..., are 0, 2, 16, 180, 1868, 18649, 186335, 1863390, 18634236, 186340191, ... . Apparently, the asymptotic density of this sequence exists and equals 0.01863... . - Amiram Eldar, Jan 18 2023
The asymptotic density of this sequence is 1 - 3/zeta(2) + 3 * Product_{p prime} (1 - 2/p^2) - Product_{p prime} (1 - 3/p^2) = 1 - 3 * A059956 + 3 * A065474 - A206256 = 0.018634010349844827414... . - Amiram Eldar, Sep 12 2024

References

  • Jean-Marie De Koninck, Ces nombres qui nous fascinent, Entry 48, p. 18, Ellipses, Paris, 2008.

Crossrefs

Subsequence of A013929 and A068781.

Programs

  • Mathematica
    f[n_] := Union[ Transpose[ FactorInteger[n]] [[2]]] [[ -1]]; a = 0; b = 1; Do[c = f[n]; If[a> 1 && b > 1 && c > 1, Print[n - 2]]; a = b; b = c, {n, 3, 10^6}]
    Flatten[Position[Partition[SquareFreeQ/@Range[3000],3,1],?(Union[#] == {False}&),{1},Heads->False]] (* _Harvey P. Dale, May 24 2014 *)
    f@n_ := Flatten@  Position[Partition[SquareFreeQ /@ Range@2000, n, 1], Table[False, {n}]]; f@3 (* Hans Rudolf Widmer, Aug 30 2022 *)

Formula

a(n) = A235578(n) - 1. - Amiram Eldar, Feb 09 2021

Extensions

More terms from Jason Earls and Robert G. Wilson v, May 10 2002
Offset corrected by Amiram Eldar, Feb 09 2021