26799

Appears in sequences

• T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=39A046802
• T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=41A046802
• Numbers n such that sum of first n consecutive prime numbers is pandigital (includes all 10 digits exactly once).at n=4A049442
• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == n (mod 3) so far).at n=44A060730
• Number of permutations of length n with no consecutive triples i,...i+r,...i+2r for all positive r, and for all equal spacings d.at n=4A174084
• Wiener index of a benzenoid consisting of a spiral chain of n hexagons (s=1; see the Gutman et al. reference).at n=18A193391
• Semiprimes at which the Chebyshev bias of semiprimes == 3 (mod 4) and == 1 (mod 4) becomes positive.at n=2A196937
• Numbers k such that the sum of the first k consecutive prime numbers is pandigital (includes all 10 digits at least once).at n=4A228468
• Semiprimes with strictly increasing product of digits.at n=50A246569
• Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n >= 0 and 0 <= k <= n.at n=38A272098
• Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n >= 0 and 0 <= k <= n.at n=40A272098
• Number of broken 3-diamond partitions of n.at n=16A328541
• 2*a(n) is the start of 3 consecutive numbers (even-odd-even) that are sums of divisors, i.e., terms of A000203.at n=46A342555