19095

Appears in sequences

• a(n) = T(n,n+2) where T is the array defined in A025564.at n=8A025568
• Numerators of continued fraction convergents to sqrt(832).at n=7A042606
• Number of A095321-primes in range ]2^n,2^(n+1)].at n=20A095331
• Number of set partitions of {1, ..., n} that avoid 3-crossings.at n=9A108304
• Riordan array (1/sqrt(1-2*x-3*x^2), M(x)-1) where M(x) is the g.f. of the Motzkin numbers A001006.at n=57A114422
• Multiples of 19 containing a 19 in their decimal representation.at n=35A121039
• Numbers k such that k and k+1 have 4 distinct prime factors.at n=26A140078
• Zero followed by partial sums of A059100, starting at n=1.at n=38A145068
• 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=38A153783
• Numbers whose sum of triangular divisors is also a divisor and greater than 1.at n=24A209311
• Number of (w,x,y,z) with all terms in {1,...,n} and w*x+y*z>n^2.at n=21A212136
• Number of simple labeled graphs on n+2 nodes with exactly n connected components that are trees or cycles.at n=18A215862
• Number of n X 2 nonnegative integer arrays with upper left 0 and lower right n+2-6 and value increasing by 0 or 1 with every step right or down.at n=10A252924
• Number of starting positions of Kayles with n pieces such that the 2nd player can win (P-positions).at n=48A263453
• Numbers k such that k and k+1 each have at least 4 distinct prime factors.at n=26A321504
• Number of non-isomorphic multiset partitions of weight n with no constant parts and only two distinct vertices.at n=24A323654
• a(1) = 1; thereafter a(n) = Sum_{k = 1..n} a(k/gcd(n,k)).at n=16A333613
• a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 7.at n=4A367248
• Number of subsets of {1..n} containing n such that it is possible to choose a different binary index of each element.at n=28A370639