116281

Appears in sequences

• Squares of odd octagonal numbers.at n=5A014793
• a(n) = (9*n + 8)^2.at n=37A017258
• a(n) = (10*n + 1)^2.at n=34A017282
• a(n) = (11*n)^2.at n=31A017390
• a(n) = (12*n + 5)^2.at n=28A017582
• Expansion of 1/((1-x)^7 - x^7).at n=14A049017
• a(n) = (Lucas(6*n) - 2)/16.at n=5A049683
• Squares of the form 5n*(n-1)+1.at n=2A062788
• a(n) = n*(n+1)*(n+2)*(n+3)+1 = (n^2 + 3*n + 1)^2.at n=17A062938
• Number of words of length 2n-1 generated by the two letters s and t that reduce to the identity 1 by 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=10A072844
• Positions of check bits in code in A075937.at n=34A075939
• Squares arising as partial products in A094357 + 1.at n=3A093959
• Number of walks of length n between two adjacent nodes in the cycle graph C_7.at n=20A094052
• Unsigned member r=-17 of the family of Chebyshev sequences S_r(n) defined in A092184.at n=5A099275
• Number of divisors of 240^n.at n=30A103532
• a(n)=sigma(A128607(n)), where A128607(n) is the sequence of perfect (or pure) powers such that a(n) is a perfect power.at n=4A128608
• First differences of A138477.at n=19A138495
• Squares of Jacobsthal numbers.at n=10A139818
• Triangle, read by rows, T(n, k) = binomial(3*n, 2*k) + binomial(3*n, 2*(n-k)).at n=35A154919
• Triangle, read by rows, T(n, k) = binomial(3*n, 2*k) + binomial(3*n, 2*(n-k)).at n=28A154919