75013

Properties

Appears in sequences

• Number of distinct coefficients in expansion related to enumeration of permutations of length n by length of longest subsequence.at n=23A068604
• a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2).at n=22A215004
• a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number.at n=23A215006
• a(n) = Fibonacci(2n + 1) - n.at n=11A280523
• a(n) = a(n-1) + a(n-2) + a([(n-1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=23A298352
• Numbers that have decimal expansion c(1)c(2)...c(n) with distinct digits that satisfy c(1) <> 0, c(1) is the largest digit, and for each i in 1..n there is j in {0, 1} such that c(i) == 2*c(i-1) + j (mod 10) (with c(0): = c(n)).at n=10A336670
• Consecutive states of the linear congruential pseudo-random number generator (2661*s + 36979) mod 175000 when started at s=1.at n=28A385361
• Prime numbersat n=7395