28686

Appears in sequences

• a(n) = F(n+1) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th non-Fibonacci number.at n=21A022799
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,25.at n=11A064249
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,27.at n=12A064250
• a(n) = 3*n^3 + 2*n^2 + n.at n=21A067389
• Integers i such that 41*i = 105 X i.at n=21A115876
• Number of nondecreasing Dyck paths of semilength n and having no peaks at odd level (n>=0). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.at n=17A121482
• Numbers k such that k and k^2 use only the digits 2, 5, 6, 8 and 9.at n=9A137114
• Number of 4-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=23A187587
• Half the number of nXnXn triangular binary arrays with every element unequal to at most 3 neighbors.at n=5A192499
• G.f.: 1/G(0) where G(k) = 1 - q^(k+1) / (1 - q^(k+2)/G(k+1) ).at n=19A227309
• Partitions with superdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 >= i.at n=58A238860
• Least number k such that k^n + n and k^n - n are both prime, or 0 if no such number exists.at n=12A239475
• a(0) = a(1) = 1; a(n) = Sum_{k=0..n-2} lcm(a(k), a(n-k-2)).at n=17A318123
• a(n) = number of k-tuples (u(1), u(2), ..., u(k)) with 1 <= u(1) < u(2) < ... < u(k) <= n such that u(i) - u(i-1) <= 5 for i = 2,...,k.at n=14A356621
• G.f.: 1/Product_{k>=1} (1 - x^(3*k^2)) * (1 - x^k).at n=34A385012