105469

Appears in sequences

• Generalized Fibonacci numbers.at n=12A015441
• a(n) = (9^n-4^n)/5.at n=6A016153
• Numbers m such that k = m*23^2 divides 3^(k-1) - 2^(k-1).at n=26A130058
• a(n) = (4*3^n - 5*2^n + (-2)^n)/20.at n=12A167910
• Number of n-digit 8th powers.at n=44A216658
• a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3/2) as in A328644.at n=11A329017
• a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3/2) as in A328644.at n=5A329019
• Numbers k such that (3^ord(3/2, k) - 2^ord(3/2, k))/k is a prime, where ord(3/2, k) is the multiplicative order of 3/2 (mod k).at n=33A345705
• a(n) = 90*binomial(n,6) + 90*binomial(n,5) + 54*binomial(n,4) + 24*binomial(n,3) + 9*binomial(n,2) + 3*n + 1.at n=11A382640
• All integers k that can produce a closed walk in an equilateral triangular lattice via noncongruent primitive k-length diagonals, in ascending order.at n=2A387031