The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346508 Positive integers k such that 10*k+1 is equal to the product of two integers greater than 1 and ending with 1 (A346507). 3

%I #17 Sep 11 2021 16:12:23

%S 12,23,34,44,45,56,65,67,78,86,89,96,100,107,111,122,127,128,133,144,

%T 149,155,158,166,168,170,177,188,189,191,199,209,210,212,220,221,232,

%U 233,243,250,251,254,260,265,275,276,282,287,291,296,298,309,311,313,317

%N Positive integers k such that 10*k+1 is equal to the product of two integers greater than 1 and ending with 1 (A346507).

%H Stefano Spezia, <a href="/A346508/b346508.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = (A346507(n) - 1)/10.

%F Conjecture: lim_{n->infinity} a(n)/a(n-1) = 1.

%F The conjecture is true since a(n) = (A346507(n) - 1)/10 and lim_{n->infinity} A346507(n)/A346507(n-1) = 1. - _Stefano Spezia_, Aug 21 2021

%e 107 is a term because 21*51 = 1071 = 107*10 + 1.

%t a={}; For[n=1, n<=350, n++, For[k=1, k<n, k++, If[Mod[10n+1, 10k+1]==0 && Mod[(10n+1)/(10k+1), 10]==1 && 10n+1>Max[10a+1], AppendTo[a, n]]]]; a

%o (Python)

%o def aupto(lim): return sorted(set(a*b//10 for a in range(11, 10*lim//11+2, 10) for b in range(a, 10*lim//a+2, 10) if a*b//10 <= lim))

%o print(aupto(318)) # _Michael S. Branicky_, Aug 21 2021

%Y Cf. A016873 (ending with 5), A017281, A324298 (ending with 6), A346507, A346509, A346510.

%K nonn,base

%O 1,1

%A _Stefano Spezia_, Jul 21 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 15:47 EDT 2024. Contains 372738 sequences. (Running on oeis4.)