19714

Appears in sequences

• Number of positive integers <= 2^n of form x^2 + 10 y^2.at n=17A000024
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=37A025100
• Numerators of continued fraction convergents to sinh(1).at n=10A078980
• Convolution of sequence of primes with sequence sigma(n).at n=27A086718
• a(n) = Sum_{d|n} rad(d)^(n/d), where rad(d) = A007947(d) is the squarefree kernel of d.at n=26A095001
• Number of outerplanar graphs on n labeled nodes.at n=6A098000
• Number of partitions of n into parts with at most one 1 and at most one 2.at n=47A121081
• Row 4 of array in A144502.at n=3A144497
• Column 3 of array in A144502.at n=4A144499
• Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.at n=31A144502
• n^3 + n-th cubefree number.at n=26A180499
• Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2>=x^2+y^2.at n=34A211803
• Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=11A241257
• Numbers k such that F(k)*F(k+1) + F(k+2) is a prime, where F = A000045 (Fibonacci numbers).at n=30A305414
• Sum of the prime parts in the partitions of n into 10 parts.at n=34A309471
• Composite numbers k such that k-A238525(k) and k+A238525(k) are prime.at n=43A342648
• a(n) is the number of sets of distinct four-cuboid combinations that fill an n X n X n cube excluding combinations that contain cube-shaped cuboids.at n=27A386756