25500
domain: N
Appears in sequences
- Absolute value of coefficient of term [x^(n-7)] in characteristic polynomial of maximum matrix A of size n X n, where n >= 7. Maximum matrix A(i,j) is MAX(i,j), where indices i and j run from 1 to n.at n=4A112463
- Phi(A033631(n)) {phi is the Euler totient function A000010}.at n=14A115620
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=10A135196
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 6.at n=52A136888
- Numbers k such that k and k^2 use only the digits 0, 2, 5 and 6.at n=20A136911
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 7.at n=58A136912
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 8.at n=29A136913
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=29A136914
- Number of prefix normal words of length n.at n=17A194850
- Triangle T(n,k) read by rows: T(n,k) is the number of rooted hypertrees on n labeled vertices with k hyperedges, n >= 2, k >= 1.at n=37A210586
- G.f. satisfies: A(x)^2 = A(x^2)^2 + 4*x.at n=17A223142
- G.f.: A(x,y) = Sum_{n>=0} x^n * Product_{k=1..n} (k + x*y) / (1 + k*x*y), as a triangle read by rows.at n=27A231171
- Numbers n which appear at least twice in A037278(n), concatenation of their divisors written in base 10.at n=32A248323
- Numbers k such that (41*10^k + 49)/9 is prime.at n=25A254441
- a(n) = A255470(2^n-1).at n=7A255471
- Numbers n such that sigma(n) = m*sigma(n+2) with some m > 1.at n=1A260988
- Number of n element multisets of the 10th roots of unity with zero sum.at n=42A321416
- Ordered perimeters p of primitive Pythagorean triangles no side of which is squarefree.at n=41A329392
- Numbers of squares and rectangles of all sizes in 3*n*(n+1)/2-ominoes in form of three-quarters of Aztec diamonds.at n=16A338996
- a(n) is the least number k such that A018804(k)/k = n.at n=21A353264