31553

Appears in sequences

• A Fielder sequence.at n=16A001643
• a(n) = a(n-1) + a(n-2) + a(n-3), a(0)=3, a(1)=1, a(2)=3.at n=17A001644
• T(n,n-1), array T as in A047060.at n=9A047063
• a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.at n=17A075536
• Number of palindromes that use nonzero digits and have a digit sum of n.at n=29A082267
• Number of palindromes that use nonzero digits and have a digit sum of n.at n=30A082267
• Powers of 3-Step Lucas numbers (A001644).at n=35A105949
• Positive integers m with 2^m*p(m) + 1 prime, where p(.) is the partition function (A000041).at n=29A236390
• 9-step Fibonacci sequence starting with 0,0,0,0,1,0,0,0,0.at n=24A251749
• Nonprime squarefree numbers whose prime indices all have the same Omega (A001222) and the same sum of prime indices (A056239).at n=15A327908