19425

Appears in sequences

• E.g.f. tan(tan(x)/cosh(x)), odd powers only.at n=4A009709
• Coordination sequence for sigma-CrFe, Position Xd.at n=35A009959
• a(n) = n*(2*n+5)*(2*n+7).at n=15A035329
• Sum of consecutive nonsquares.at n=21A048395
• a(n)=A069522(n)/n.at n=51A088392
• Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=17A096517
• Least positive integer which, when added to each of 2^1, ..., 2^n, yields all primes; or 0 if none exists.at n=8A110096
• Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.at n=50A111246
• Number of base 29 n-digit numbers with adjacent digits differing by one or less.at n=7A126383
• Near-prime numbers: numbers n such that n-2=prime, n+2=prime, n-4=prime, n+4=prime, n-8=prime, n+8=prime.at n=3A143727
• Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n).at n=61A144385
• Triangle in A144385 with rows left-adjusted.at n=40A144399
• Triangle in A144385 read downwards by columns.at n=61A144402
• Triangle in A144385 read upwards by columns.at n=59A144417
• a(n) = (15*n^2+45*n-70)*binomial(n+4,6)/8.at n=6A144516
• Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 0 <= k <= n), read by rows.at n=50A144633
• Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 1 <= k <= n), read by rows.at n=40A144634
• A triangle related to the GF(z) formulas of the rows of the ED3 array A167572.at n=23A167583
• Numbers k such that k-4, k-2, k+2 and k+4 are prime.at n=18A173037
• Number of n X 7 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=27A188864