22660

Appears in sequences

• Shifts 5 places right under inverse binomial transform.at n=14A010749
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=32A024689
• Numbers whose set of base-12 digits is {1,4}.at n=33A032824
• One eighty-fourth the area of primitive Pythagorean triangles with (increasing) square hypotenuses (precisely those of A008846).at n=11A072289
• Triangle read by rows: T(n,k) is the number of secondary structures of size n with no stacks of length >=2 and having k stacks of length 1 (n>=0, k>=0).at n=65A202851
• Number of 2 X n 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=8A223962
• Number of partitions of n such that neither the number of parts nor the number of distinct parts is a part.at n=41A241380
• 100-gonal numbers: a(n) = 98*n*(n-1)/2 + n.at n=22A261276
• Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=40A290040
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 5 or 8 king-move adjacent elements, with upper left element zero.at n=9A304267
• Primitive practical numbers (A267124) with a record gap to the next primitive practical number.at n=12A334883
• Number of ways to write n as an ordered sum of 10 prime powers (including 1).at n=8A341139
• Numbers that are the sum of seven fourth powers in exactly six ways.at n=35A345828
• 31-gonal numbers: a(n) = n*(29*n-27)/2.at n=40A360488
• a(n) is the number of permutations of [n] which avoid the patterns 1234, 1324, 1342, and 2413.at n=10A369431
• Number of length n inversion sequences avoiding the patterns 102 and 210.at n=9A374542