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-4 of 4 results.

A348054 Positive integers that are the product of two integers ending with 7.

Original entry on oeis.org

49, 119, 189, 259, 289, 329, 399, 459, 469, 539, 609, 629, 679, 729, 749, 799, 819, 889, 959, 969, 999, 1029, 1099, 1139, 1169, 1239, 1269, 1309, 1369, 1379, 1449, 1479, 1519, 1539, 1589, 1649, 1659, 1729, 1739, 1799, 1809, 1819, 1869, 1939, 1989, 2009, 2079, 2109
Offset: 1

Views

Author

Stefano Spezia, Sep 26 2021

Keywords

Examples

			49 = 7*7, 119 = 7*17, 189 = 7*27, 259 = 7*37, 289 = 17*17, 329 = 7*47, 399 = 7*57, ...

Crossrefs

Cf. A017377 (supersequence), A053742 (ending with 5), A139245 (ending with 2), A324297 (ending with 6), A346950 (ending with 3), A347253 (ending with 4), A348055.

Programs

  • Mathematica
    a={}; For[n=0, n<=210, n++, For[k=0, k<=n, k++, If[Mod[10*n+9, 10*k+7]==0 && Mod[(10*n+9)/(10*k+7), 10]==7 && 10*n+9>Max[a], AppendTo[a, 10*n+9]]]]; a
  • Python
    def aupto(lim): return sorted(set(a*b for a in range(7, lim//7+1, 10) for b in range(a, lim//a+1, 10)))
print(aupto(2110)) # Michael S. Branicky, Sep 26 2021

Formula

Lim_{n->infinity} a(n)/a(n-1) = 1.

A348546 Number of positive integers with n digits that are equal both to the product of two integers ending with 3 and to that of two integers ending with 7.

Original entry on oeis.org

0, 0, 8, 129, 1771, 21802, 252793, 2826973, 30872783
Offset: 1

Views

Author

Stefano Spezia, Oct 22 2021

Keywords

Comments

a(n) is the number of n-digit numbers in A348544.

Crossrefs

Cf. A052268, A346950, A346952, A348054, A348055, A348544, A348547.

Programs

  • Mathematica
    Table[{lo, hi}={10^(n-1), 10^n}; Length@Select[Intersection[Union@Flatten@Table[a*b, {a, 3, Floor[hi/3], 10}, {b, a, Floor[hi/a], 10}], Union@Flatten@Table[a*b, {a, 7, Floor[hi/7], 10}, {b, a, Floor[hi/a], 10}]], lo<#
  • Python
    def a(n):
  lo, hi = 10**(n-1), 10**n
  return len(set(a*b for a in range(3, hi//3+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi) & set(a*b for a in range(7, hi//7+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi))
print([a(n) for n in range(1, 9)]) # Michael S. Branicky, Oct 22 2021

Formula

a(n) < A052268(n).
a(n) = A346952(n) + A348055(n) - A348547(n).
Conjecture: lim_{n->infinity} a(n)/a(n-1) = 10.

Extensions

a(9) from Michael S. Branicky, Oct 22 2021

A348547 Number of positive integers with n digits and final digit 9 that are equal to the product of two integers ending with the same digit.

Original entry on oeis.org

1, 4, 49, 524, 5596, 58706, 608886, 6267854, 64180304, 654605898, 6656849267, 67539297095, 683989985496, 6916722312963, 69859080168037
Offset: 1

Views

Author

Stefano Spezia, Oct 22 2021

Keywords

Comments

a(n) is the number of n-digit numbers in A348545.

Crossrefs

Cf. A052268, A346950, A346952, A348054, A348055, A348545, A348546.

Programs

  • Mathematica
    Table[{lo, hi}={10^(n-1), 10^n}; Length@Select[Union[Union@Flatten@Table[a*b, {a, 3, Floor[hi/3], 10}, {b, a, Floor[hi/a], 10}], Union@Flatten@Table[a*b, {a, 7, Floor[hi/7], 10}, {b, a, Floor[hi/a], 10}]], lo<#
  • Python
    def a(n):
  lo, hi = 10**(n-1), 10**n
  return len(set(a*b for a in range(3, hi//3+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi) | set(a*b for a in range(7, hi//7+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi))
print([a(n) for n in range(1, 9)]) # Michael S. Branicky, Oct 22 2021

Formula

a(n) < A052268(n).
a(n) = A346952(n) + A348055(n) - A348546(n).
Conjecture: lim_{n->infinity} a(n)/a(n-1) = 10.

Extensions

a(9) from Michael S. Branicky, Oct 22 2021
a(10)-a(15) from Martin Ehrenstein, Nov 06 2021

A348549 Number of positive integers with n digits that are the product of two integers ending with 8.

Original entry on oeis.org

0, 1, 14, 195, 2200, 24013, 255969, 2687317, 27934809, 288342379, 2960920297, 30285890402, 308834717932, 3141625339760, 31895159990436
Offset: 1

Views

Author

Stefano Spezia, Oct 22 2021

Keywords

Comments

a(n) is the number of n-digit numbers in A348548.

Crossrefs

Cf. A052268, A348548.
Cf. A346509 (ending with 1), A346629 (ending with 2), A346952 (ending with 3), A347255 (ending with 4), A337855 (ending with 5), A337856 (ending with 6), A348055 (ending with 7).

Programs

  • Python
    def a(n):
  lo, hi = 10**(n-1), 10**n
  return len(set(a*b for a in range(8, hi//8+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi))
print([a(n) for n in range(1, 9)]) # Michael S. Branicky, Oct 22 2021

Formula

a(n) < A052268(n).
Conjecture: lim_{n->infinity} a(n)/a(n-1) = 10.

Extensions

a(9)-a(10) from Michael S. Branicky, Oct 22 2021
a(11)-a(15) from Martin Ehrenstein, Nov 06 2021
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.