30125

Appears in sequences

• a(n) = a(n-1)+a(n-4).at n=31A014097
• Look at the first 10 digits of the sequence: they are all different. The same for the next 10. And the next 10, etc. This sequence is the slowest increasing one with that property.at n=52A097912
• a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n).at n=47A113486
• a(n) = ceiling(Sum_{i=1..n-1} a(i)/4) for n >= 2 starting with a(1) = 1.at n=49A120160
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of continued fraction 1/(1 - k*x/(1 - k*x^2/(1 - k*x^3/(1 - k*x^4/(1 - k*x^5/(1 - ...)))))).at n=72A286933
• G.f.: Sum_{k>=0} x^k * Product_{j=1..6*k} (1 + x^j)/(1 - x^j).at n=22A385092