19892
domain: N
Appears in sequences
- Sum of primes dividing Fibonacci(n) (with repetition).at n=32A064725
- Sum of prime factors of Fibonacci(n).at n=32A080648
- Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).at n=38A119808
- Demi-tribonacci numbers (rounding up): a(0)=a(1)=0, a(2)=2; a(n) = ceiling( (a(n-1)+a(n-2)+a(n-3))/2 ).at n=47A180235
- a(1) = a(2) = a(3) = 1; for n > 3, a(n) = ceiling((a(n-1) + a(n-2) + a(n-3))/2).at n=46A258875
- Expansion of Product_{k>=1} 1/(1 - x^k)^(k*(5*k-3)/2).at n=9A278769
- Number of 4Xn 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=7A281059
- Numbers n such that there are precisely 5 groups of orders n and n + 1.at n=43A295991
- Fifth Lie-Betti number of a path graph on n vertices.at n=15A364579