78652

Appears in sequences

• a(n) = Sum_{k=0..n} T(k) where T(n) are the tribonacci numbers A000073.at n=19A008937
• Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(4,8).at n=16A018921
• Number of permutations p of 1,2,...,n satisfying |p(i+2)-p(i)| not equal to 2 for all 0<i<n-1.at n=9A110128
• Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0).at n=50A118884
• List of different composites in Pascal-like triangles with index of asymmetry y = 2 and index of obliquity z = 0 or z = 1.at n=47A141066
• a(n) = p^2*(p + 3)/2, where p = prime(n).at n=15A179546
• a(n) = 4*n^3 - 3*n + 1.at n=27A280089
• Number T(n,k) of permutations p of [n] such that |p(i+k) - p(i)| <> k for i in [n-k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=47A333706
• Number of row states in an automaton for the enumeration of the number of fixed polyominoes with bounding box of width n.at n=12A378947