36287
domain: N
Appears in sequences
- Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.at n=25A003458
- Number of certain stackings of n+1 squares on a double staircase.at n=18A055244
- Triangle of number of permutations by length of shortest ascending run.at n=28A064315
- Frobenius number of the numerical semigroup generated by consecutive hex numbers.at n=6A069759
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=35A127028
- a(n) = (n! - 10)/10.at n=4A139185
- a(n) = 28*n^2 - 1.at n=35A158554
- Number of unlabeled graphs on n nodes whose components are cycles or complete graphs.at n=30A217067
- Number of permutations of [n] having a shortest ascending run of length one.at n=8A228614
- a(n) is the number of ways to express 2*n+1 as a sum of parts x such that x+2 is an odd prime.at n=47A333615