77658

Appears in sequences

• Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,69.at n=8A065702
• Numbers n such that the n-th row of triangle in A073932 contains exactly the divisors of n.at n=44A073935
• Numbers representable in exactly two ways as (p-1)*p^e (where p is a prime and e >= 0) in ascending order.at n=24A114874
• a(6n+k) = 3a(6n+k-1)-3a(6n+k-2)+2a(6n+k-3), k = 0, 1, 3, 4, 5; a(6n+2) = 3a(6n+1)-3a(6n). a(0) = a(1) = 0, a(2) = 1.at n=19A132658
• a(n) = p^2*(p-1), where p = prime(n).at n=13A135177
• The lexicographically earliest sequence such that a(n) - a(n-1) is the largest proper divisor of a(n).at n=23A191614
• Denominator of the rationals obtained from the e.g.f. D(1,x), a Debye function.at n=42A227540
• a(p^n)=p^(n+1)(p-1) if p is prime and a(nm)=lcm(a(n),a(m)) if gcd(n,m)=1.at n=42A236563
• The least positive integer in A055744 divisible by A008578(n).at n=14A256430
• Numbers A055744(n) such that for any k < n, A055744(k) and A055744(n) do not have all their prime factors in common.at n=25A256431
• 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=26A272934
• Solutions to the congruence 1^n+2^n+...+n^n == 43 (mod n).at n=7A280043
• a(n) is the n-th term of the inverse Euler transform of j-> n^(j-1).at n=6A306173
• a(n) is the n-th term of the inverse Weigh transform of j-> n^(j-1).at n=6A316073
• Totients congruent to 2 mod 4 and that have multiplicity 4.at n=13A334839
• a(n) is the area of the rectangle whose edges are n and A375673(n).at n=40A375675
• The Euler totient of the smallest cube divisible by n.at n=42A390754
• The Euler totient of the smallest cubefull number divisible by n.at n=42A390756