50887
domain: N
Appears in sequences
- Numbers whose base-15 representation has exactly 5 runs.at n=20A043672
- Lucky numbers that are the sum of the first k primes for some k.at n=17A046286
- a(0)=0, a(1)=1, a(n)=a(n-1)+a(n-2)+a(n-3) if a(n-1) is even, a(n)=a(n-1)+a(n-2) if a(n-1) is odd.at n=21A078513
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-8).at n=5A114360
- Triangular matrix T, read by rows, such that the anticommutator of T and U shifts the columns of T up 1 row: {T,U}(n,k) = T(n+1,k), where U denotes the triangular matrix defined by U(n,k) = A000108(n-k) = Catalan(n-k) for n>=k and where T(n,n) = (n+1).at n=46A116077
- A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes.at n=27A140763
- Semiprimes in A007504 (the sum of first n primes).at n=36A189072
- Expansion of g.f. (6 + 5*x - 20*x^2 - 12*x^3 + 12*x^4 + 3*x^5)/(1 + x - 5*x^2 - 4*x^3 + 6*x^4 + 3*x^5 - x^6).at n=16A216605
- Triangle read by rows: T(n,k) is the number of ascent sequences of length n with first occurrence of the maximal value at position k-1.at n=54A218580
- Number of connected dominating sets in the n-prism graph.at n=9A286985