54900
domain: N
Appears in sequences
- Numbers which can be written as b^2*c^2*(b^2+c^2).at n=36A063663
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=33A064111
- (Sum of digits of n)^5 - (sum of digits^5 of n).at n=45A069965
- a(n) = n^2*(2*n+1).at n=30A099721
- a(n+2) = 18*a(n+1) - a(n) + 8.at n=4A119032
- 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, 0, 0), (-1, 0, 1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=9A149064
- Triangle T(n, k) = 1 if k = 0 or k = n, otherwise n^5 - k^5 - (n-k)^5, read by rows.at n=49A157634
- Triangle T(n, k) = 1 if k = 0 or k = n, otherwise n^5 - k^5 - (n-k)^5, read by rows.at n=50A157634
- a(n) = 61*n^2.at n=30A174333
- Numbers with prime factorization pq^2r^2s^2.at n=33A189344
- Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<3z.at n=17A212512
- Number of ways of writing n as the sum of 10 triangular numbers from A000217.at n=18A226254
- Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of permutations of n with k alignments.at n=53A263775
- Numbers m equal to |d_1^k + Sum_{j=2..k} (-1)^j*d_j^k| where d_1 d_2 ... d_k is the decimal expansion of m.at n=13A335151
- Primitive numbers that are the sum of the squares of two of their distinct divisors.at n=24A338485
- a(n) is the number of large or small squares that are used to tile primitive squares of type 1 whose length of side is A344333(n).at n=21A344334
- a(n) is the number of large or small squares that are used to tile primary squares of type 1 (see A344331) whose side length is A345285(n).at n=26A345286
- Number T(n,k) of (binary) heaps of length n whose element set equals [k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=61A373451