26642

Appears in sequences

• Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=27A006145
• Expansion of 1/(1-x^3-x^4-x^5).at n=41A017818
• Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=28A039752
• Numbers common to A006145 and A039752.at n=4A039753
• Numbers n such that 105*2^n-1 is prime.at n=39A050578
• Number of compositions (ordered partitions) of n into 1's, 2's and 4's.at n=19A060945
• Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=20A064675
• Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=30A064678
• Decimal concatenations of the 38 quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5).at n=7A078870
• Number of different candle trees having a total of m edges.at n=9A097472
• Numbers n such that 1 + Sum{k=1..n/2} A001223(2k-1)*(-1)^k = 0.at n=21A130642
• Numbers n such that 1 - S(n) = 0, where S(n) = (S(n-1) + A000040(n))*(-1)^n; S(0)=0, n=>1.at n=26A131197
• a(n) = 2662*n + 22.at n=9A157613
• a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4).at n=20A181532
• Expansion of 1 / (1 - x - x^3 + x^6) in powers of x.at n=36A193771
• The number of all possible covers of L-length line segment by 3-length line segments with allowed gaps < 3.at n=38A228362
• Number of (n+1)X(2+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=1A234754
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.at n=4A234760
• E.g.f. satisfies: A(x) = Sum_{n>=1} [Integral exp(n*A(x)) dx]^n/n.at n=5A268294
• Numbers k such that reverse(T(k)) = T(reverse(k)) where T(k) is the k-th triangular number.at n=10A279084