54289

Appears in sequences

• a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=24A006498
• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=13A007598
• Squares of odd Fibonacci numbers.at n=8A014728
• a(n) = (7*n+2)^2.at n=33A017006
• a(n) = (8*n + 1)^2.at n=29A017078
• a(n) = (9*n + 8)^2.at n=25A017258
• a(n) = (10*n + 3)^2.at n=23A017306
• a(n) = (11*n + 2)^2.at n=21A017414
• a(n) = (12*n + 5)^2.at n=19A017582
• Strong pseudoprimes to base 33.at n=17A020259
• Numbers whose set of base-15 digits is {1,4}.at n=33A032827
• Squares in A037159.at n=2A037160
• Square numbers that are concatenations of two or more prime numbers.at n=36A038692
• Squares with initial digit '5'.at n=18A045788
• Squares of primes lacking the digit zero in their decimal expansion.at n=39A052043
• Prime powers p^w (w >= 2) such that p^w-2 is prime.at n=32A053704
• Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.at n=20A063907
• a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=14A065885
• a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.at n=25A074677
• Distinct-digit prime powers of prime numbers.at n=41A076702