42756

Appears in sequences

• 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(3,9).at n=9A018919
• 4-wave sequence.at n=32A038197
• Third line of 4-wave sequence A038197.at n=10A038249
• Number of ternary (0,1,2) sequences without a consecutive '012'.at n=10A076264
• Expansion of 1/sqrt(1-4*x^2-4*x^3).at n=15A115962
• Triangle read by rows: T(n,k) is the number of ternary words of length n containing k 012's (n >= 0, 0 <= k <= floor(n/3)).at n=22A119851
• Number of binary words whose (unique) decreasing Lyndon decomposition is into Lyndon words each with an odd number of 1's; EULER transform of A000048.at n=18A123916
• The (1,2)-entry in the 3 X 3 matrix M^n, where M = {{2, 1, 1}, {1, 1, 0}, {1, 0, 0}}.at n=11A123941
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-1,0,1,2}, n=3*r+p_i, and define a(-1)=1. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,1,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^3-2*x) with x=2*cos(Pi/9).at n=37A187503
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-1,0,1,2}, n=3*r+p_i, and define a(-1)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,3,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^3-2*x) with x=2*cos(Pi/9).at n=35A187505
• Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-1,0,1,2}, n=3*r+p_i, and define a(-1)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,4,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^3-2*x) with x=2*cos(Pi/9).at n=34A187506
• T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents.at n=43A200785
• a(n) = pg(n, 3) + pg(n, 4) + ... + pg(n, n) where pg(n, m) is the m-th n-th-order polygonal number.at n=23A245679
• T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.at n=43A255107
• Numbers k such that abs(A328258(k)) = abs(A328258(k+1)).at n=33A348586
• Wiener index in diamond nanowires obtained by connecting n unit cells in a sequence.at n=6A366816
• Number of integer partitions of n containing all divisors of all parts.at n=49A371178
• Triangle read by rows: T(n,k) is the sum of the lengths of the free polyominoes with n cells and length k, n >= 1, k >= 1.at n=60A379638