28922

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has period 49.at n=34A020388
• Number of n-node rooted trees of height at most 7.at n=14A034824
• 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, 0, 1), (-1, 1, 1), (0, 1, -1), (1, -1, 0), (1, 0, 0)}.at n=9A148875
• Number of 0..n arrays of length 3 with each element differing from at least one neighbor by something other than 1.at n=30A221574
• Number of partitions p of n such that (maximal multiplicity over the parts of p) = (number of numbers in p having multiplicity > 1).at n=52A241132
• Number of n X 2 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=8A268803
• Compound filter: a(n) = P(A257993(n), A278226(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=55A286382
• Numbers n such that there are precisely 2 groups of order n and 3 of order n + 1.at n=26A296025
• Irregular table read by rows: Take a triangle with Pythagorean triple leg lengths with all diagonals drawn, as in A332978. Then T(n,k) = number of k-sided polygons in that figure for k >= 3 where the legs are divided into unit length parts.at n=42A333135