103684

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=24A000211
• Squares of Lucas numbers.at n=12A001254
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=24A001638
• Number of restricted circular combinations.at n=22A006499
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=23A007039
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=23A007040
• Squares of even Lucas numbers.at n=4A014731
• a(n) = (10*n + 2)^2.at n=32A017294
• a(n) = (11*n + 3)^2.at n=29A017426
• a(n) = (12*n+10)^2.at n=26A017642
• Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=24A048162
• a(n) and floor(a(n)/5) are both squares; i.e., squares which remain squares when written in base 5 and last digit is removed.at n=10A055812
• a(n) = Lucas(n) + (-1)^n + 1.at n=23A068397
• Squares which are the arithmetic mean of two consecutive primes.at n=40A069495
• Number of ways to partition {1,2,...,n} into arithmetic progressions, where in each partition all the progressions have the same common difference and have lengths >= 2.at n=26A072255
• Squares k such that k + pi(k) is a prime.at n=32A073946
• a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).at n=12A075150
• a(n) = Lucas(4n)+2 = Lucas(2n)^2.at n=6A081069
• a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.at n=12A092387
• Duplicate of A068397.at n=23A102081