54290

Appears in sequences

• a(n) = Sum_{d|Fibonacci(n)} d^2.at n=12A063478
• Number of basis partitions of n+81 with Durfee square size 9.at n=29A069252
• A Binet type formula from a polynomial whose coefficient expansion gives a tribonacci used as its first derivative InverseZtransform: A000073.at n=13A116573
• Constant term in the reduction by (x^2 -> x + 1) of the polynomial F(n+3)*x^n, where F = A000045 (Fibonacci sequence).at n=12A192883
• Coefficient of x in the reduction by (x^2 -> x+1) of the polynomial F(n+4)*x^n, where F = A000045 (Fibonacci sequence).at n=11A192920
• a(n) = Fibonacci(n)^2+1.at n=13A245306
• Expansion of 1/(1 - Sum_{k>=2} floor(bigomega(k)/2)*floor(2/bigomega(k))*x^k), where bigomega(k) is the number of prime divisors of k counted with multiplicity (A001222).at n=57A280238
• Numbers k such that (10^k + 41)/3 is prime.at n=23A281493
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 0, a(3) = 2.at n=24A295688
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=32A300166
• Number of compositions (ordered partitions) of n into parts having the same number of prime divisors (counted with multiplicity) as n.at n=57A301333
• Numbers sandwiched between two semiprimes, one of which is a square.at n=34A358686