18319
domain: N
Appears in sequences
- Convoluted convolved Fibonacci numbers G_7^(r).at n=18A089113
- Sign twisted convoluted convolved Fibonacci numbers H_7^(r).at n=18A089114
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, -1, 1), (0, 0, -1), (1, 1, 1)}.at n=8A149673
- Triangle defined by T(n,k) = T(n-1,k-1) + Sum_{j=k..n-2} T(n-1,j)*2^j*T(j,k-1) for n>k>0 with T(n,n)=T(n,0)=1, read by rows.at n=30A152795
- Column 2 of triangle A152795.at n=5A152797
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=25A166057
- a(n) = (n^4 + 16*n^3 + 65*n^2 + 26*n + 12)/12.at n=18A188480
- Number of partitions of n such that 2*(greatest part) < (number of parts).at n=46A237751
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood.at n=29A268154
- Number of nonempty sets {p_1, p_2, ..., p_k} such that Product_{i=1..k} p_i divides Product_{i=1..k} (n + p_i), where the p_i are distinct primes.at n=89A334127
- Numbers k such that both Sum_{i=1..k} i*prime(i) and Sum_{i=1..k} (k+1-i)*prime(i) are prime.at n=31A356178
- Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=37A357694
- G.f. satisfies A(x) = 1 + x*A(x)^4*(1 + x*A(x)^3).at n=6A365182