34362

Appears in sequences

• Number of ferrites M_{10}Y_n that repeat after 6n+50 layers.at n=15A011964
• a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.at n=26A027959
• 1 / min{1/n - 1/a - 1/b > 0}, where a and b are integers.at n=17A045470
• a(n) = A045820(n)/2.at n=20A045822
• a(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3.at n=55A079398
• Largest denominator used in the Egyptian fraction representation of n/(n + 1) by the greedy algorithm.at n=21A100695
• Irregular array read by rows, where n-th row gives denominators of the Egyptian fraction expansion, derived using the greedy algorithm, for the absolute value of the fractional part of the (2n)th Bernoulli number.at n=24A136375
• a(n) = 3*a(n-1)-3*a(n-2)+a(n-3)+a(n-4).at n=17A138653
• Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=28A147811
• Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0).at n=60A223092
• Table of denominators in the Egyptian fraction representation of n/(n+1) by the greedy algorithm.at n=72A247765
• Prime power pseudoperfect numbers: numbers m > 1 such that 1/m + Sum 1/p^k = 1, where the sum is over the prime powers p^k | m.at n=40A283423
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=24A286781
• Column 3 of A286781.at n=3A286788
• G.f.: [ Sum_{n>=0} (2*n + 1) * x^n * (9 - x^n)^n ]^(1/3).at n=5A326606