115248
domain: N
Appears in sequences
- A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=61A049325
- a(n) = 7^(n^2+2n+1)*Product_{j=1..n} (49^j-1).at n=1A090769
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+16807)^2 = y^2.at n=16A118576
- a(n) = (n^3 - n^2)*7^n.at n=3A128990
- a(n) = P(n)^3 - P(n)^2 where P(n) = A000931(n).at n=20A133039
- a(n) = n^6 - n^4.at n=7A136038
- a(n) = prime(n)^6 - prime(n)^4.at n=3A138411
- Numbers with 50 divisors.at n=26A175756
- Numbers with prime factorization pq^4r^4.at n=25A190012
- Replace 3^i with n^i in ternary representation of n.at n=47A193760
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and positive odd determinant.at n=27A210373
- Number of 2 X 2 matrices having all terms in {1,...,n} and positive odd determinant.at n=27A211068
- Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y>=2z.at n=28A212505
- a(n) = 3*n^4.at n=14A219056
- Area A of the bicentric quadrilaterals such that A, the sides, the radius of the circumcircle and the radius of the incircle are integers.at n=7A219192
- A triangle T(n,k) read by rows which can be used to calculate the area of a regular polygon with sides having length 1, provided that the polygon has an odd number of sides.at n=8A343051
- Denominators of the remainders in the greedy Egyptian fraction representation of 1 with square denominators (A348626).at n=8A348640
- a(n) is the index of the least n-gonal number that is the sum of two or more consecutive nonzero n-gonal numbers in more than one way, or -1 if no such number exists.at n=5A360777
- a(n) = [x^n](1/2)*(1 + (2*x + 1)/sqrt(1 - 8*x^2*(x + 1))).at n=12A360856
- The second Jordan totient function applied to the powerful numbers: a(n) = A007434(A001694(n)).at n=29A379716