A341035 -id:A341035 - cp's OEIS frontend

A355790 Numbers that can be written as the product of two divisors greater than 1 such that the number is contained in the string concatenation of the divisors.

64, 95, 110, 210, 325, 510, 624, 640, 664, 950, 995, 1010, 1100, 1110, 3250, 3325, 5134, 6240, 6400, 6640, 6664, 7125, 7616, 8145, 9500, 9950, 9995, 11000, 11100, 11110, 20100, 21052, 21175, 25100, 26208, 32500, 33250, 33325, 35126, 50100, 51020, 51204, 51340, 57125, 62400, 64000, 65114

Offset: 1

Scott R. Shannon, Jul 17 2022

			64 is a term as 64 = 16 * 4 and "16" + "4" = "164" contains "64".
65114 is a term as 65114 = 4651 * 14 and "4651" + "14" = "465114" contains "65114".
See the attached text file for other examples.

Scott R. Shannon, Divisor product of the first 232 terms. These are all the numbers up to 50000000.

Cf. A355791 (base-2), A030190, A210959, A027750, A355852, A339144, A341035, A342127, A027748, A048991, A330027, A077293.

from sympy import divisors
def ok(n):
    s, divs = str(n), divisors(n)[1:-1]
    return any(s in str(d)+str(n//d) for d in divs)
print([k for k in range(1, 10**5) if ok(k)]) # Michael S. Branicky, Jul 27 2022

A341028 a(n) is the smallest positive integer such that n+a(n) contains the string n-a(n) in reverse as a substring. If no such number exists then a(n) = -1.

Original entry on oeis.org

-1, -1, -1, -1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 10, 10, 10, 10, 10, 15, 15, 9, 15, 15, 20, 20, 20, 20, 20, 25, 25, 25, 9, 25, 29, 30, 30, 30, 30, 33, 34, 35, 35, 9, 37, 38, 39, 40, 40, 41, 42, 43, 44, 45, 9, 50, 50, 50, 50, 55, 41, 51, 52, 53, 54, 9, 60, 60, 60, 65, 50, 32, 52, 53, 54, 70, 9

Offset: 1

Scott R. Shannon, Feb 02 2021

Based on a search limit of 5*10^9 up to n = 300000 the values of n for which no a(n) is found are n = 1,2,3,4. This is likely the complete list of values for which a(n) = -1.
The longest run of consecutive terms with the same value in the first 300000 terms is the run of 5's at the beginning of the sequence, ten in all. This is likely the longest run for all numbers.
Numerous patterns exist in the values of a(n), e.g., when a(n) consists of all 9's and n is not a power of 10 then n is palindromic.

			a(5) = 5 as 5+5 = 10 which contains reverse(5-5) = reverse(0) = 0 as a substring.
a(6) = 5 as 6+5 = 11 which contains reverse(6-5) = reverse(1) = 1 as a substring.
a(15) = 10 as 15+10 = 25 which contains reverse(15-10) = reverse(5) = 5 as a substring.
a(22) = 9 as 22+9 = 31 which contains reverse(22-9) = reverse(13) = 31 as a substring.

Scott R. Shannon, Image of the terms for n = 5..300000. It is possible the frame-like pattern continues to larger and larger scales resulting in a fractal structure.

Cf. A341034 (forward), A341035 (forward and reverse), A339403, A339144, A328095, A333410, A332703.

A341034 a(n) is the smallest positive integer such that n+a(n) contains the string n-a(n) as a substring. If no such number exists then a(n) = -1.

Original entry on oeis.org

-1, -1, -1, -1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 10, 10, 10, 10, 10, 15, 15, 15, 15, 15, 20, 20, 20, 20, 20, 25, 25, 25, 25, 25, 29, 30, 30, 30, 30, 33, 34, 35, 35, 35, 37, 38, 39, 40, 40, 41, 42, 43, 44, 45, 45, 46, 47, 48, 49, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50

Offset: 1

Scott R. Shannon, Feb 03 2021

Based on a search limit of 5*10^9 up to n = 200000 the values of n for which no a(n) is found are n = 1,2,3,4. This is likely the complete list of values for which no a(n) exists.

The sequence contains long runs of consecutive terms with the same value, resulting in the image for the values having a staircase-like pattern. In the first 200000 terms the longest run is 88890 terms, starting from a(61110), all of which have a(n) = 50000.

			a(5) = 5 as 5+5 = 10 which contains 5-5 = 0 as a substring.
a(6) = 5 as 6+5 = 11 which contains 6-5 = 1 as a substring.
a(15) = 10 as 15+10 = 25 which contains 15-10 = 5 as a substring.
a(35) = 29 as 35+29 = 64 which contains 35-29 = 6 as a substring.

Scott R. Shannon, Line graph of the terms for n=5..6111.

Cf. A341028 (reverse), A341035 (forward and reverse), A339403, A339144, A328095, A333410, A332703.

cp's OEIS Frontend

A355790 Numbers that can be written as the product of two divisors greater than 1 such that the number is contained in the string concatenation of the divisors.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A341028 a(n) is the smallest positive integer such that n+a(n) contains the string n-a(n) in reverse as a substring. If no such number exists then a(n) = -1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A341034 a(n) is the smallest positive integer such that n+a(n) contains the string n-a(n) as a substring. If no such number exists then a(n) = -1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs