18485

Appears in sequences

• Number of multigraphs with 5 nodes and n edges.at n=16A014395
• Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 11.at n=17A051976
• a(n) = sum of the first n lower twin primes.at n=40A086167
• Numbers k such that k^2 + k - 1 and k^2 + k + 1 are twin primes and (k + 1)*(k + 1) + k + 1 - 1 and (k + 1)*(k + 1) + k + 1 + 1 are also twin primes.at n=9A088498
• Triangle read by rows: T(n,k) is number of peakless Motzkin paths of length n and having k uhh...hd's starting at level 0, where u=(1,1), h=(1,0) and d=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=45A098071
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=8A149617
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 0), (0, 1), (1, -1), (1, 1)}.at n=8A151293
• Number of peakless Motzkin paths of length n and having no uhh...hd's starting at level 0, where u = (1, 1), h = (1, 0) and d = (1, -1).at n=15A190159
• Number of length n+3 0..4 arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=34A248533
• Numbers k such that 413*2^k+1 is prime.at n=19A323106
• A(n, k) = (m*k)! [x^k] MittagLefflerE(m, x)^n, for m = 3, n >= 0, k >= 0; square array read by descending antidiagonals.at n=41A326474
• Number of graph minors in the cycle graph C_n.at n=25A353206