142128

Appears in sequences

• Numerators of continued fraction convergents to sqrt(857).at n=10A042654
• Numbers that are divisible by all of their 1 and 2 digit substrings.at n=39A063527
• a(n) = Fibonacci(n+2)^2 - 1.at n=12A080097
• a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 if n odd, a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 - F(5) if n even, where F(n) is the n-th Fibonacci number (A000045).at n=11A080144
• a(n)= 3*a(n-1) -3*a(n-3) +a(n-4), n>6.at n=15A107840
• a(n) = (2*n+1)*(n+1)*(2*n^2+3*n-1).at n=13A123197
• Weight distribution of [63,24,15] primitive binary BCH code.at n=22A151736
• Record numbers of A171063 nonzero period n solutions of x(i)=(x(i-1)+x(i-2)) mod m, as encountered in (n=1,m=1; n=1,m=2; n=2,m=1) antidiagonal order.at n=34A171061
• Record numbers of A171063 nonzero period n solutions of x(i)=(x(i-1)+x(i-2)) mod m, as encountered in (n=1,m=1; n=2,m=1; n=1,m=2) antidiagonal order.at n=35A171062
• Golden Triangle sums: a(n) = a(n-1) + A001654(n+1) with a(0)=0.at n=12A180664
• 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=13A192883
• 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=12A192920
• Number of partitions of n in which two summands (of each size) are designated.at n=32A255180
• Numbers that are a product of distinct Fibonacci numbers (A000045) and also a product of distinct Lucas numbers (A000032, including 2).at n=23A274371
• 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=26A295688