42744

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=26A001210
• Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(8,16).at n=13A018922
• Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=38A028644
• Numbers k such that k^2 contains every digit at least once.at n=13A054038
• Engel expansion of Pi^e = 22.4592.at n=36A059197
• Expansion of 1/(1-2*x+x^5).at n=16A107066
• a(n) is the largest number in the n-th row of triangle A140996.at n=17A141019
• List of different composites in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1.at n=34A141069
• Numbers n such that n^2 contains every decimal digit exactly once.at n=13A156977
• Number of 0..5 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=5A200868
• Number of 0..n arrays x(0..7) of 8 elements without any interior element greater than both neighbors or less than both neighbors.at n=4A200876
• Number of binary words of length n avoiding the subword given by the binary expansion of n.at n=16A234005
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / (1 - log(1-x) * log(1-y))^2.at n=48A382799
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / (1 - log(1-x) * log(1-y))^2.at n=51A382799