20236
domain: N
Appears in sequences
- A Fielder sequence. a(n) = a(n-1) + a(n-3) + a(n-4) + a(n-5), n >= 6.at n=18A001639
- Generalized Fibonacci numbers D_{n,3}.at n=16A006211
- Numbers k such that 7*2^k - 5 is prime.at n=34A058602
- a(n) = A051193(A072109(n))/A018804(A072109(n)).at n=6A071645
- Bisection of A096441.at n=31A096967
- Number of length n+2 0..7 arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=2A248460
- T(n,k)=Number of length n+2 0..k arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=38A248461
- Number of length 3+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=6A248464
- Numbers k such that (19*10^k - 49)/3 is prime.at n=22A282138
- a(n) = Sum_{p in P} y(1)*y(2), where P is the set of partitions of n, and y(k) is the number of parts with multiplicity at least k in p.at n=27A316861
- Number of free polyominoes with n cells with at most 4 collinear cell centers on any line in the plane.at n=40A380990