105985

Appears in sequences

• a(1)=1, a(n) = a(n-1) + n^3 if n odd, a(n) = a(n-1) + n^2 if n is even.at n=29A140154
• One ninth of the alternating sum of the squares of the first n Fibonacci numbers with index divisible by 4.at n=4A156093
• Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = Product_{j=1..n} p(j, k+1), p(n, x) = Sum_{j=0..n} (-1)^j*A053122(n, j)*x^j, and m = 8, read by rows.at n=17A156602
• Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = Product_{j=1..n} p(j, k+1), p(n, x) = Sum_{j=0..n} (-1)^j*A053122(n, j)*x^j, and m = 8, read by rows.at n=18A156602
• a(0)=1, a(1)=4; thereafter a(n) = 13*4^n/8-2^(n+1)+1.at n=8A256959
• a(n) sets a new record for the Lychrel number a(n) of 'Reverse and Add' steps, needed to reach a Lychrel number m < a(n) (i.e., its seed).at n=6A323975
• Let q be the n-th prime power (A246655), then a(n) = q^3 + q^2 - q; number of solutions to x*y = z*w in the finite field F_q.at n=21A367014