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!)
A034173 a(n) is minimal such that prime factorizations of a(n), ..., a(n)+n-1 have same exponents. 13

%I #36 Jan 02 2023 12:30:46

%S 1,2,33,19940,204323,380480345,440738966073

%N a(n) is minimal such that prime factorizations of a(n), ..., a(n)+n-1 have same exponents.

%C a(8) > 10^13. - _Donovan Johnson_, Oct 20 2009

%C _Don Reble_ has shown that a(8) < 1.9*10^42, cf. link.

%C From _David Wasserman_, Jan 05 2019: (Start)

%C a(8) <= 108111092880293127811946663766147737122,

%C a(9) <= 6850672946809600696044301071559918192380244,

%C a(10) <= 96037988156124494415303285590850571857698741869620,

%C a(11) <= 9044737840075556371215937303485030235666252755947862558252154847122. (End)

%H Don Reble, <a href="http://list.seqfan.eu/oldermail/seqfan/2012-October/010353.html">A034173(8) exists</a>, SeqFan list, Oct 23 2012

%F a(n) = A034174(n) - n + 1. - _Max Alekseyev_, Nov 10 2009

%F a(n) = A083785(n,1) = A113456(1,n); a(2) = A052213(1), a(3) = A052214(1), a(4) = A175590(1), a(5) = A218448(1), a(6) = A218448(62) = A218448(63)-1. - _M. F. Hasler_, Oct 28 2012

%e a(4) = 19940 because 19940, ..., 19943 all have the form p^2 q r.

%o (PARI) A034173(n)={my(f);for(k=1,9e9,f=0;for(i=1,n, f==(f=vecsort(factor(k+n-i)[,2])) || i==1 || [k+=n-i; next(2)]);return(k))} \\ _M. F. Hasler_, Oct 23 2012

%Y Cf. A034174.

%Y Cf. A006558, A083790.

%Y Cf. A052213, A052214, A175590, A218448. This sequence is the first column of A083785 and first row of A113456. The latter generalizes to arithmetic progressions with step d>=1. - _M. F. Hasler_, Oct 28 2012

%K hard,nonn,more

%O 1,2

%A _Dean Hickerson_, Oct 01 1998

%E a(7) from _Donovan Johnson_, Oct 20 2009

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 April 25 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)