19615

Appears in sequences

• Number of ways to partition n elements into pie slices of different sizes other than one.at n=40A032155
• Numbers k such that 20*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A056678
• Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer Heronian triangle having triangular area.at n=20A070148
• Structured snub cubic numbers.at n=14A100150
• Numerator of Sum_{k=1..n} (-1)^(k+1)/k^4.at n=3A120296
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, -1, 1), (0, 0, 1), (1, 1, -1)}.at n=9A148496
• Partial sums of A151791.at n=32A151792
• The z^2 coefficients of the polynomials in the GF4 denominators of A156933.at n=4A157708
• a(n) is the smallest number k > 0 such that k, k + 1, ... , k + n - 1 are nonprime numbers, but k + n is prime.at n=46A230358
• Number of partitions p of n such that median(p) <= mean(p).at n=36A240218
• Number of partitions p of n such that median(p) > mean(p).at n=50A240220
• Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=15A254899
• a(n) is the smallest number k such that the difference between the next prime greater than k and k equals n.at n=45A309877
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/k)^4.at n=11A344722