23715

Appears in sequences

• a(n) = (4*n+1)*(4*n+3).at n=38A001539
• Ceiling of Gamma(n+2/7)/Gamma(2/7).at n=9A020123
• Reversion of g.f. (beginning with x term) for number of trees with n nodes.at n=12A037247
• a(n)= product of all odd composite numbers between n-th prime and (n+1)-st prime.at n=35A061215
• a(n) = n*(n+1)*(n^2 + n + 4)/4.at n=17A061316
• Numbers k such that sigma(k^2-k-1) = k*(k+1).at n=29A069826
• Position of A075165(n) in A014486 plus one.at n=30A075163
• Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).at n=20A094530
• a(n) = (7*n^3 + 6*n^2 + 5*n) / 6.at n=27A101165
• Number of partitions of n having positive even rank (the rank of a partition is the largest part minus the number of parts).at n=46A101708
• Values of y arising from representations of -n in A102535.at n=18A102779
• Position of A106455(n) in A014486 plus one.at n=46A106453
• Numbers k such that k and 4*k, taken together, are pandigital.at n=7A115924
• Expansion of (1 + x*c(x))/(1 - x), where c(x) is the g.f. of A000108.at n=11A155587
• Partial sums of A097331; binomial transform of A166587.at n=21A166588
• Partial sums of A097331; binomial transform of A166587.at n=22A166588
• a(n) = largest number k such that k and k * n taken together have distinct digits, or 0 if no such k exists.at n=3A173780
• The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs).at n=30A180577
• Numbers k such that tau(k+1) - tau(k) = 3, where tau(k) = the number of divisors of k (A000005).at n=10A230653
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of parts of p.at n=47A241831