19287

Appears in sequences

• Fibonacci sequence beginning 1, 31.at n=15A022401
• a(n) = a(n-1) + a(n-2) + n, a(0) = a(1) = 1.at n=18A030119
• Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=38A035988
• a(n) = prime(n)^2 - n.at n=33A182174
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=45A214023
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=20A214038
• Consider the spiral of Theodorus (A072895). This sequence is closely related to A224269 and gives the number of k successive revolutions such that the triangles are closer to 360 degrees than any previous triangles.at n=25A227626
• Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 6.at n=13A244707
• Sequence of distinct least nonnegative numbers such that the average of the first n terms is a Fibonacci number.at n=29A249265
• p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)(1 - 2 S).at n=10A291734
• Number of pairs (p,q) of partitions of n such that the set of parts in q is a proper subset of the set of parts in p.at n=20A369910