18772

Appears in sequences

• Number of strict first-order maximal independent sets in cycle graph.at n=34A007391
• Number of partitions of n in which the least part is odd.at n=36A026804
• Numerators of continued fraction convergents to sqrt(751).at n=7A042446
• A Graham-Pollak-like sequence with cube root instead of square root.at n=37A100673
• a(0)=a(1)=a(2) = 1. a(n) = (a(n-1) +a(n-2)) /GCD(a(n-1)+a(n-2),a(n-3)), for n >= 3.at n=35A123274
• 13 times the squares: a(n) = 13*n^2.at n=38A152742
• Right edge of the triangle in A033291.at n=37A192736
• Numbers n such that c(n) = p_{2n}, where c(n) is the n-th Chebyshev prime and p_{2n} the 2n-th prime.at n=5A196674
• Number of ways to place 2 non-attacking ferses on an n X n board.at n=13A201243
• Number of triples (w,x,y) with all terms in {0,...,n} and w <= floor((x+y)/3).at n=37A212973
• G.f. satisfies: A(x) = 1/A(-x*A(x)^4).at n=6A214764
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 2 3 4 6 or 7.at n=7A252272
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 2 3 4 6 or 7.at n=37A252278
• Numbers m such that sigma(m) is a partition number.at n=22A252891
• a(n) = (1/n^2) * Sum_{d|n} moebius(n/d)*binomial(2*d,d).at n=11A268619
• Table read by rows: T(n,k) = number of k-sided polygons in an equal-armed cross with arms of length n (see Comments in A331456 for definition) for k = 3,4,5,6,7.at n=36A333037
• Positions k where A348733(k) is not multiplicative.at n=19A348740
• a(n) = n + 2*binomial(n,2) + 3*binomial(n,3) + 4*binomial(n,4).at n=19A361099