209952

Appears in sequences

• a(n) = a(n-1)*a(n-2).at n=6A000304
• Generalized Euler phi function (for p=3).at n=11A003474
• Values of x in positive integer solutions of x^2 + y^5 = z^3, listed in increasing order of z. (If a z-value occurs twice, list solutions in increasing order of y.)at n=15A070065
• a(n) = 2^A066657(n) * 3^A066658(n).at n=14A076941
• Product of consecutive previous terms (starting with 2,3).at n=13A080338
• Increasing gaps between 3-smooth numbers (upper end).at n=37A084790
• Triangle read by rows: T(n,k) = 2^k * 3^n, 0 <= k <= n.at n=41A100852
• a(n)=denominator of the probability that (x-y)/(x+y)+(y-z)/(y+z)+(z-u)/(z+u)+ (u-x)/(u+x) >0, assuming that each random quadruple of integers (x,y,z,u), with a<=x,y,z,u<=n, is equally likely.at n=35A106200
• Matrix log of triangle A111840, which shifts columns left and up under matrix cube; these terms are the result of multiplying each element in row n and column k by (n-k)!.at n=39A111843
• Numbers of the form Product_i b_i^e_i, where the b_i are all distinct values > 1 and the e_i are a permutation of the b_i.at n=35A122405
• a(n) = ceiling(6^n/n).at n=7A129790
• a(n) = floor(6^n/n).at n=7A129796
• Largest k such that k <= 81*(number of digits of k^n)*(number of digits of k^(n+1)).at n=8A130179
• Multiples of 4 that are primally tight and have strictly ascending powers.at n=37A145108
• Totally multiplicative sequence with a(p) = 6*(p+1) for prime p.at n=39A166646
• a(n) = n^n*(3+n)/2.at n=5A174962
• Floor[1/{(3+n^4)^(1/4)}], where {}=fractional part.at n=53A184538
• a(n) = (n/4)*3^(n/2)*((1+sqrt(3))^2+(-1)^n*(1-sqrt(3))^2).at n=16A187273
• Numerator of A010786(n+1) / A010786(n).at n=34A208449
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| >= w + |y-z|.at n=36A212714