18901

Appears in sequences

• Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,1,0.at n=6A033132
• Number of n-node rooted identity trees of height at most 6.at n=18A038085
• Sums of 5 distinct powers of 5.at n=13A038477
• Denominators of continued fraction convergents to sqrt(29).at n=10A041047
• Denominators of continued fraction convergents to sqrt(116).at n=10A041211
• a(0) = 1, a(1) = 5, a(n+1) = 5*a(n) + a(n-1).at n=6A052918
• Table by antidiagonals of T(n,k) = n*T(n,k-1) + T(n,k-2) starting with T(n,1) = 1.at n=61A073133
• Main diagonal of array A083861.at n=7A082297
• First differences of Chebyshev polynomials S(n,27) = A097781(n) with Diophantine property.at n=3A097835
• a(0)=1, a(1)=1, a(n)=7*a(n/2) for n=2,4,6,..., a(n)=6*a((n-1)/2)+a((n+1)/2) for n=3,5,7,....at n=41A116522
• Triangle, read by rows, T(n, k) = Fibonacci(n, k), where Fibonacci(n, x) is the Fibonacci polynomial.at n=33A117715
• Triangle generated from Pell polynomials.at n=51A118243
• a(n) = n^3 - n^2 - 2*n + 1.at n=27A123972
• a(n) = 900*n + 1.at n=20A158407
• Number of binary strings of length n with no substrings equal to 0000 0011 or 0110.at n=14A164427
• Append three digits, each increasing by one modulo 10 from the last digit of the nonnegative integers. 0 -> 123, 1 -> 1234 2 -> 2345, ... , 9 -> 9012, 10 -> 10123, etc.at n=18A167231
• Array A(n,k) = n*A(n,k-1) + A(n,k-2) read by upward antidiagonals, starting A(n,0) = 0, A(n,1) = 1.at n=73A172236
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=5.at n=29A172342
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=5.at n=34A172342
• a(n) is the least number such that k = n*a(n) has sum of digits n and ends with the digit string n, or 0 if no such number exists.at n=30A175690