[seqfan] Re: a(1) = 11, a(2) = ?,

[Hugo Pfoertner]

Checking only for divisibility by squares of "small" (<100000) primes I get
p, f(p) divisible by q^2:
p  q
11 5
179 17
199 3
211 11
271 3
499 7
1013 5
1171 3
2269 3
2531 5
2801 7
3617 17
4013 5
4513 5
8161 5
9769 3
10709 151
10771 11
14293 3
14551 73
16189 17
16363 3
16651 31
19813 3
19927 3
20051 17
20341 3
21713 17
22123 3
23251 5
27457 5
27509 23
30817 13
31277 5
32603 5
32653 5
34849 11
35911 5
36563 5
37657 11
38303 191
38639 137
40813 5
...
The occurrence of terms divisible by larger square factors is very unlikely.

Hugo Pfoertner

On Wed, Mar 28, 2018 at 1:57 PM, юрий герасимов <2stepan at rambler.ru> wrote:

> where a(n) = primes p such that binomial(p^2, p) - p^p is divisible by
> square >
> 1. Thanks. JSG.
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>