23595

Appears in sequences

• a(n) = binomial(n+6,6)*(6*n+7)/7.at n=8A034265
• Numbers k such that k-th and (k+1)-st term of A038593 differ by 3.at n=20A038634
• Duplicate of A034265.at n=8A050485
• Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=25A050781
• a(n) = (a(n-1) + a(n-3)) * a(n-2) / a(n-4). a(1) = a(2) = a(3) = a(4) = 1.at n=10A078918
• Ninth column (m=8) of (1,6)-Pascal triangle A096956.at n=7A097299
• Convolution of Fibonacci(n-1) and 3^n.at n=9A106517
• Eleven times hexagonal numbers: a(n) = 11*n*(2*n-1).at n=33A154617
• Integers of the form A164577(k)/3.at n=31A164619
• Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k excedances (0<=k<=floor(n/2)).at n=44A186368
• Numbers such that the sum of the largest and the smallest prime divisor equals the sum of the other distinct prime divisors.at n=38A199745
• Number of (w,x,y) with all terms in {0,...,n} and w>floor((x+y)/3).at n=32A212974
• Sigma(n)-n values in A085844.at n=34A216383
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 245", based on the 5-celled von Neumann neighborhood.at n=31A271006
• Triangle T(n,m) read by rows: the sum of runs of all sequences arranging n objects of one type and m objects of another type.at n=42A349147
• Numbers k such that k is a multiple of A005941(k).at n=49A364550
• Odd numbers k such that k is a multiple of A005941(k).at n=8A364551
• Expansion of g.f. A(x,y) satisfying A(x,y) = 1 + x*A(x,y)/(1 - x*y * A(x,y))^2, as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y), read by rows n >= 0.at n=74A365770
• Triangle read by rows: T(n, k) = binomial(n + k, k) * binomial(2*n - k, n - k) / (n + 1).at n=39A371395
• Triangle read by rows: T(n, k) = binomial(n + k, k) * binomial(2*n - k, n - k) / (n + 1).at n=41A371395