OFFSET
1,1
COMMENTS
Primes p such that A072453(p) = 0.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..3000
C. Cobeli and A. Zaharescu, Promenade around Pascal Triangle-Number Motives, Bull. Math. Soc. Sci. Math. Roumanie, Tome 56(104) No. 1, 2013, pp. 73-98. - From N. J. A. Sloane, Feb 16 2013
Lorenz Halbeisen and Norbert Hungerbuehler, Number theoretic aspects of a combinatorial function, Notes on Number Theory and Discrete Mathematics 5 (1999) 138-150. (ps, pdf)
Wikipedia, Annihilating primes
PROG
(Perl) use warnings;
use strict;
use ntheory ":all";
use Math::GMPz;
use Memoize; memoize 'a000522';
sub a000522 {
my($n, $sum, $fn) = (shift, 0, Math::GMPz->new(1));
do { $sum += $fn; $fn *= ($n-$_); } for 0 .. $n;
$sum;
}
sub a072453 {
my $n = shift;
vecsum( map { a000522($_) % $n == 0 } 0 .. $n-1 );
}
forprimes { print "$_\n" unless a072453($_) } 1000;
# Dana Jacobsen, Feb 16 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 02 2002
EXTENSIONS
More terms from Vladeta Jovovic, Aug 02 2002
Offset corrected by Amiram Eldar, May 15 2020
STATUS
approved