24463

Appears in sequences

• Number of words of length 2n generated by the two letters s and t that reduce to the identity 1 using the relations sssssss=1, tt=1 and stst=1. The generators s and t along with the three relations generate the 14-element dihedral group D7.at n=9A072266
• Number of walks of length n between two adjacent nodes in the cycle graph C_7.at n=17A094052
• Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=6.at n=27A143457
• a(n) = Lucas(3*n) - Fibonacci(n).at n=7A245799
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n+1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, b(3) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A296843
• Positions of records in A329656.at n=15A329657
• Odd composite integers m such that A004254(m-J(m,21)) == 0 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol.at n=42A340098
• Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph.at n=31A367183
• Cogrowth sequence for the 14-element dihedral group D7 = <S,T | S^7, T^2, (ST)^2>.at n=18A377573
• a(n) = Sum_{k=0..n} binomial(7*n+3,7*k+1).at n=2A387817