The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108795 Conjectured greatest number k such that C(2k,k) is not divisible by any odd prime to the n-th power. 0
 1, 786, 538279, 1430148153 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Checked by Jack Brennen to 5.93*10^10 and in fact every number beyond 14384056005 was divisible by at least two odd-prime-fourth-powers. C(2*14384056005,14384056005) seems to be the last such number which is only divisible by a single odd-prime-fourth-power, being divisible by 5^9 but by no other prime more than 3 times. REFERENCES R. K. Guy, Unsolved Problems in Number Theory, C33. LINKS Table of n, a(n) for n=1..4. EXAMPLE a(1)=1 because for all k's>1 C(2k,k) is divisible by an odd prime. a(2)=786 because it is the last entry in A059097, i.e., C(1572,786) has no prime factor squared. MATHEMATICA expoPF[k_, n_] := Module[{s = 0, x = n}, While[x > 0, x = Floor[x/k]; s += x]; s]; goodQ[n_] := Module[{i = 2, p}, While[p = Prime[i]; p <= n && expoPF[p, 2n] < 3 + 2expoPF[p, n], i++ ]; p > n]; Do[ If[ goodQ[n], Print[n]], {n, 5500000}] CROSSREFS Cf. A059097. Sequence in context: A031734 A097776 A031526 * A097774 A031896 A045231 Adjacent sequences: A108792 A108793 A108794 * A108796 A108797 A108798 KEYWORD nonn AUTHOR R. K. Guy and Robert G. Wilson v, Nov 29 2005 EXTENSIONS a(4) from Jack Brennen, Nov 30 2005 STATUS approved

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.

Last modified June 9 11:22 EDT 2023. Contains 363178 sequences. (Running on oeis4.)