50305

Appears in sequences

• Expansion of (1-x)/(1 - 3*x + x^2)^2.at n=9A001870
• a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers).at n=19A024458
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).at n=18A025078
• Number of binary rooted trees with n nodes and height at most 6.at n=26A036589
• Numbers that are palindromic and divisible by 5.at n=26A043040
• Triangle read by rows in which row n gives n smallest n-digit multiples of n that are palindromes.at n=13A084024
• Palindromes in A085936.at n=17A085937
• Beginning with 1 palindromes with prime successive differences.at n=28A088049
• Convoluted convolved Fibonacci numbers G_j^(2).at n=19A089089
• Sign twisted convoluted convolved Fibonacci numbers H_j^(2).at n=19A089098
• Palindromic Smith numbers.at n=25A098834
• Number of 0's in odd position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=20A129720
• Number of 0's in even position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=20A129722
• Number of partitions of 3n into parts >= 3.at n=21A182806
• Palindromes of the form 4n + 1 that are divisible by 5.at n=14A256704