24564

Appears in sequences

• Numbers n such that n | 11^n + 11.at n=17A015903
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=49A019293
• Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.at n=11A058877
• Starting at the chess position shown, a(n) is the number of ways Black can make n consecutive moves, followed by a checkmate in one move by White.at n=20A078993
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0}.at n=24A080008
• Slater-Velez permutation sequence of the 2nd kind.at n=27A129198
• Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).at n=43A133399
• First differences of A160644.at n=35A160646
• Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^13 = I.at n=14A166857
• a(n) = (4*n^3 + n^2 - 3*n)/2.at n=23A172073
• a(n) = sigma(n*2^(n-1)).at n=10A176362
• Number of set partitions of [n] that avoid 1231 and 1121.at n=12A209230
• Number of additive Z_2 Z_8 codes of a certain type (see Siap-Aydogdu for precise definition).at n=9A226264
• Smallest number k such that A049559(k) / A187730(k) = n.at n=10A284440
• Numbers k such that 5*10^k + 81 is prime.at n=22A291611
• a(n) = Sum_{k = n..2*n+1} k^2.at n=21A299646
• Numbers k such that phi(k) and phi(k+1) are perfect powers (A001597).at n=43A332008
• Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).at n=31A366503
• Maximum second Zagreb index of maximal 3-degenerate graphs with n vertices.at n=44A372025
• Irregular triangle read by rows: T(n,k) is the number of rooted binary normal unlabeled galled trees with n leaves and exactly k galls, 0 <= k <= floor((n-1)/2).at n=33A380306