17948
domain: N
Appears in sequences
- a(n) = prime(n)*prime(n-1) + 1.at n=32A023523
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=41A025102
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.at n=25A049724
- Numbers k such that (k!)^2 + prime(k) is prime.at n=12A064769
- Number of right triangles on a (n+1)X9 grid.at n=10A189813
- Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n).at n=14A190645
- Numbers k such that A206369(k) = A206369(k + 1).at n=19A206368
- Numbers n such that uphi(n) = uphi(n+1), where uphi(n) is the unitary totient function (A047994).at n=25A287055
- Number of maximal irredundant and minimal dominating sets in the n X n rook complement graph.at n=6A291623
- a(n) is the number of integer partitions of n for which the greatest part minus the least part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=54A318176
- Number of double-free integer partitions of n.at n=45A323092
- Numbers k such that iphi(k) = iphi(k+1), where iphi(k) is an infinitary analog to the Euler totient function (A091732).at n=21A326403
- First differences of A349295.at n=7A349296
- Numbers k such that A384247(k) = A384247(k+1).at n=31A385743