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!)
A349420 Primes that do not divide any term of A275027. 1
2, 3, 7, 11, 31, 41, 67, 73, 79, 89, 97, 101, 103, 107, 127, 131, 137, 181, 211, 251, 277, 281, 283, 293, 307, 311, 317, 331, 347, 349, 359, 367, 383, 409, 419, 421, 431, 449, 463, 523, 547, 563, 577, 599, 607, 613, 617, 631, 677, 683, 691, 773, 787, 797, 821, 823, 827, 911, 977 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
f(n) = A275027(n) is never divisible by a prime p if none of the values f(0), f(1), ..., f(p-1) is divisible by p. See Henningsen and Straub, who ask for an explicit characterization for these primes.
LINKS
Joel A. Henningsen and Armin Straub, Generalized Lucas congruences and linear p-schemes, arXiv:2111.08641 [math.NT], 2021.
MATHEMATICA
f[n_] := f[n] = Sum[Binomial[n, k]^2*Binomial[n - k, k], {k, 0, n/2}]; q[p_] := AllTrue[Table[f[k], {k, 2, p - 1}], ! Divisible[#, p] &]; Select[Range[1000], PrimeQ[#] && q[#] &] (* Amiram Eldar, Nov 17 2021 *)
PROG
(PARI) f(n) = sum(k=0, n, binomial(n, k)^2*binomial(n-k, k)); \\ A275027
isdiv(v, n) = {my(p=prime(n)); for (k=1, p, if (!(v[k] % p), return(1)); ); return(0); }
lista(nn) = {my(p=prime(nn), v=vector(p, k, f(k-1)), list=List()); for(n=1, nn, if (! isdiv(v, n), listput(list, prime(n)); ); ); Vec(list); }
CROSSREFS
Cf. A275027.
Sequence in context: A120856 A138000 A322118 * A323067 A140108 A034295
KEYWORD
nonn,changed
AUTHOR
Michel Marcus, Nov 17 2021
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 20:36 EDT 2024. Contains 373088 sequences. (Running on oeis4.)