|
Search: id:A079407
|
|
|
| A079407 |
|
Numbers n such that the least s>=0 such that sum(k=0,n,(k+s)!/C(n,k)) is an integer satisfies s=n-1. |
|
+0
1
|
|
| 1, 2, 4, 5, 13, 17, 19, 23, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Seems that sequence consists of 1, 2, 4, 5, 13, 17, 19, 23 union primes >=31
|
|
PROGRAM
|
(PARI) for(n=1, 150, s=0; while(frac(sum(k=0, n, (k+s)!/binomial(n, k)))>0, s++); if(n-s==1, print1(n, ", ")))
|
|
CROSSREFS
|
Sequence in context: A102932 A128457 A139485 this_sequence A078652 A102992 A136563
Adjacent sequences: A079404 A079405 A079406 this_sequence A079408 A079409 A079410
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 16 2003
|
|
|
Search completed in 0.002 seconds
|
