23526

Appears in sequences

• Number of paths from (0,0) to (3n,0) that stay in first quadrant (but may touch horizontal axis), where each step is (2,1),(1,2) or (1,-1) and start with (1,2).at n=6A033296
• a(n) is smallest number m such that m = n*pi(m), where pi(k) = number of primes <= k (A000720).at n=7A038625
• Numbers k such that k | sigma_11(k) - phi(k)^11.at n=16A055705
• Numbers k such that pi(k) divides k.at n=35A057809
• Consider the sequence {b(m)} of nonprimes; sequence gives values of m where gcd{m, b(m)} increases.at n=35A058011
• Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=33A071949
• Consecutive min and max-terms of solution-clusters of A057809, i,e, least and largest solutions to n=x/A000720[x].at n=14A087241
• A convolution triangle of numbers based on A027307.at n=30A110682
• a(n) = 729*n - 531.at n=32A156771
• Bases b in which the increasing concatenation of all primes smaller than b forms a prime number.at n=9A217040
• Number of compositions of n having exactly five fixed points.at n=14A240740
• 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 distinct parts of p.at n=51A241820
• a(n) = Sum_{k=0..n} binomial(n,k) * (2^(n-k) + 3^k)^(n-k) * 3^(k^2).at n=3A245104
• Number of length n+4 0..5 arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=1A249841
• T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=16A249844
• Number of length 2+4 0..n arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=4A249846
• a(n) = [x^n] Product_{k>=1} (1 + x^k)*(1 - x^(n*k))/((1 - x^k)*(1 + x^(n*k))).at n=24A304627
• a(n) = Sum_{1 <= i <= j <= k <= m <= n} gcd(i,j,k,m).at n=24A344992