41265

Appears in sequences

• Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 22 (most significant digit on right).at n=33A029515
• Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).at n=38A064125
• Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.at n=22A087415
• Expansion of series reversion of x*(1-8*x)/(1-x).at n=4A131869
• 1, followed by list of numbers n such that the number of strong primes and the number of weak primes are equal at the n-th prime.at n=12A175102
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=10A207596
• Number of transitive rooted trees with n nodes.at n=24A290689
• Numbers k such that bsigma(k) = bsigma(k+1), where bsigma(k) is the sum of the bi-unitary divisors of k (A188999).at n=28A293183
• Numbers k such that iphi(k) = iphi(k+1), where iphi is the infinitary totient function (A064380).at n=12A301866
• Numbers k such that isigma(k) = isigma(k+1), where isigma(k) is the sum of the infinitary divisors of k (A049417).at n=30A306985
• Triangle read by rows: T(n,k) is the number of linear chord diagrams on 2n vertices with one marked chord such that exactly k of the remaining n-1 chords are contained within the marked chord.at n=25A336599
• Expansion of e.g.f. exp(x^2) / (1 - x * exp(x^2/2)).at n=7A375633
• Numbers k such that k and k+1 have an equal sum of modified exponential divisors: A241405(k) = A241405(k+1).at n=31A379032
• Consecutive internal states of the linear congruential pseudo-random number generator (205*s + 29573) mod 139968 when started at 1.at n=16A383127