41371

Appears in sequences

• Number of bipartite partitions.at n=20A002767
• Strong pseudoprimes to base 14.at n=15A020240
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 14.at n=16A022178
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 14.at n=19A022178
• Numbers k such that k^2 is palindromic in base 14.at n=29A030072
• Numbers whose set of base-14 digits is {1,4}.at n=30A032826
• Numbers whose set of base-14 digits is {1,3}.at n=30A032921
• Numbers whose set of base-14 digits is {1,2}.at n=30A032934
• Numbers whose set of base 14 digits is {0,1}.at n=31A033050
• a(n) = n^4 + n^3 + n^2 + n + 1.at n=14A053699
• Generalized repunits in base 14.at n=4A135519
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=54A246186
• a(n) = 1 + sigma(n) + sigma(n)^2 + sigma(n)^3 + sigma(n)^4.at n=12A258978
• a(n) is the total semiperimeter over all Motzkin polyominoes of length n.at n=11A369359