114345

Appears in sequences

• Triangle of coefficients from fractional iteration of e^x - 1.at n=19A008826
• Number of chains of n-3 partitions in the reduced partition lattice on n elements.at n=4A059355
• a(1) = 5, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.at n=5A080449
• a(n) = partitions(n)*partitions(n+1).at n=17A090982
• a(n) = (2*n)!*(2*n-1)/(2^n*n!).at n=6A126965
• a(n) = n*(8*n^2 + 1)/3.at n=35A143166
• Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}.at n=19A147577
• a(1) = 1, then partial products of Product_{n>=1} (p(n)/p(n-1)*p(n)/p(n-1)) = 1*1*1*(2)*(2)*(3/2)*(3/2)*(5/3)*(5/3)*(7/5)*(7/5)*...*; p = partition numbers, A000041 starting (1, 2, 3, 5, ...).at n=35A171646
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles.at n=47A186764
• 4*(n + 7)^3 - 27*(n + 7)^2 = (4*n +1)*(n+7)^2.at n=26A245033
• Triangle read by rows: T(n,k) is the number of oriented colorings of the facets of a regular n-dimensional orthotope using exactly k colors. Row n has 2n columns.at n=40A325008
• Number of 2 X 2 matrices over Z_n whose permanent equals their determinant.at n=32A345754
• Locations of records in A365196.at n=13A365239