26404

Appears in sequences

• a(n) = (5*n+1)*(5*n+4).at n=32A001545
• Aliquot sequence starting at 276.at n=15A008892
• Numbers m such that 2*phi(m) = phi(m+1).at n=24A050472
• Table read by descending antidiagonals where T(n,k) = T(n,k-1) + T(n,k-1)^2/k^2 and T(n,0)=n.at n=51A061314
• Column 3 of A061314.at n=6A061318
• Row sums in A100781.at n=27A100784
• a(n) = a(n-2) + 2*a(n-3), n > 3; with a(0)=0, a(1)=1, a(2)=2, a(3)=0.at n=26A134271
• Sums of the antidiagonals of Sundaram's sieve (A159919).at n=40A159920
• Table, read by antidiagonals, in which the n-th row comprises A214206(n) in position 0 followed by a second order recursive series G in which each product G(i)*G(i+1) lies in the same row of A001477 (interpreted as a square array).at n=28A182440
• Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of n-element subsets that can be chosen from {1,2,...,2*n^k} having element sum n^(k+1).at n=33A185282
• Number of n-element subsets that can be chosen from {1,2,...,2*n^2} having element sum n^3.at n=5A186730
• 6-free Fibonacci numbers.at n=31A232666
• G.f. A(x) satisfies: A(x) = x * (1 + A(x) + A(x^2)^2 + A(x^3)^3 + ...).at n=51A332753