26406

Appears in sequences

• Product of a prime and the previous number.at n=37A036689
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=26A064240
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21.at n=34A064247
• Numbers n such that the n-th row of triangle in A073932 contains exactly the divisors of n.at n=38A073935
• Numbers n such that the sum of n's digits times the sum of the factorials of n's digits is equal to n.at n=4A094209
• Numbers representable in exactly two ways as (p-1)*p^e (where p is a prime and e >= 0) in ascending order.at n=19A114874
• a(n) = 25*n^2 + 25*n + 6.at n=32A177059
• Integers that do not have a partition into a sum of an odd square and two (not necessarily distinct) triangular numbers.at n=43A191764
• Sum of positive even numbers up to n^2.at n=17A235367
• Number of length n+2 0..8 arrays with no three elements in a row with pattern aba or abb (with a!=b) and new values 0..8 introduced in 0..8 order.at n=8A243517
• Multiplicative order of 2 modulo prime(n)^2 for n >= 2.at n=36A243905
• Number of compositions of n in which the minimal multiplicity of parts equals 1.at n=15A244164
• Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=38A256102
• a(n) = (4*n+3)*(4*n+2).at n=40A256833
• a(n) = n^3/3 - 7*n/3 + 4.at n=43A270809
• Depth of Pascal's triangle such that the number of elements in the triangle is a factor of the sum of the elements.at n=21A272934
• Numbers k such that (14*10^k - 83)/3 is prime.at n=22A280584
• Expansion of Sum_{p prime, i>=1} x^(p^i)/(1 - x^(p^i)) / Product_{p prime, j>=1} (1 - x^(p^j)).at n=42A281616
• 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=38A283423
• a(n) is the least exponent k such that 3^k-1 is divisible by prime(n)^2, or -1 if no such k exists.at n=37A283620