29093

Appears in sequences

• Number of connected permutations of [1..n] (those not fixing [1..j] for 0 < j < n). Also called indecomposable permutations, or irreducible permutations.at n=8A003319
• Array T(n,k) = number of subgroups of index k in free group of rank n, read by antidiagonals.at n=34A049290
• Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.at n=28A059438
• Triangle read by rows. T(n, k) = A059438(n, k) for 1 <= k <= n, and T(n, 0) = n^0.at n=37A085771
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+1 of T), or [T^p](m,0) = p*T(p+m,p+1) for all m>=1 and p>=-1.at n=28A104980
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+1 of T), or [T^p](m,0) = p*T(p+m,p+1) for all m>=1 and p>=-1.at n=38A104980
• Triangle read by rows: number of atomic set compositions of size n and length k (see description in A095989) 1 <= k <= n.at n=35A109062
• Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime.at n=35A111064
• Square table, read by antidiagonals, where the g.f. for row n+1 is generated by: x*R_{n+1}(x) = (1+n*x - 1/R_n(x))/(n+1) with R_0(x) = Sum_{n>=0} n!*x^n.at n=43A111528
• Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.at n=35A141476
• Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.at n=43A141476
• Eigentriangle, row sums = n!at n=28A144107
• 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, -1, 0), (-1, 1, 1), (0, 1, 0), (1, 0, 0)}.at n=9A149931
• a(n) = n^3 - 3*(n+3)^2.at n=32A153260
• Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions 0 and {(m+1)*(m+2)/2-2, m>0} and then taking partial sums, starting with all 1's in row 0.at n=28A156628
• Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions 0 and {(m+1)*(m+2)/2-2, m>0} and then taking partial sums, starting with all 1's in row 0.at n=38A156628
• Augmentation of the triangular array P=A130296 whose n-th row is (n+1,1,1,1,1...,1) for 0<=k<=n. See Comments.at n=35A193094
• Triangle T(n,k), read by rows, given by (1,2,2,3,3,4,4,5,5,6,6,...) DELTA (1,0,1,0,1,0,1,0,1,0,1,0,1,...) where DELTA is the operator defined in A084938.at n=28A200659
• A recurrent sequence in Panaitopol's formula for pi(x), where pi(x) is the number of primes <= x.at n=7A233824
• Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n elements with n-k elements in its connectivity set.at n=35A263484