196605

Appears in sequences

• Integers m such that phi(m) is equal to the sum of (the product of prime factors) and (the product of exponents) of m-1.at n=7A039777
• New record highs reached in A060030.at n=32A060482
• G.f.: (x+2)*(x+1)/((x-1)*(x-2)) = Sum_{n>=0} a(n)*(x/2)^n.at n=16A068156
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^4-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=37A096035
• Inverse modulo 2 binomial transform of 2^n.at n=18A100735
• Inverse modulo 2 binomial transform of 2^n.at n=19A100735
• Inverse modulo 2 binomial transform of 4^n.at n=9A100737
• Inverse modulo 2 binomial transform of (-2)^n.at n=18A100744
• a(1) = a(2) = a(3) = a(4) = 1. For n>= 5, a(n) = a(n-1)*a(n-3) + a(n-2)*a(n-4).at n=11A111288
• a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3).at n=31A136252
• Numbers whose binary representation is a palindrome formed from the reflected decimal expansion of the concatenation of 1, 0 and infinite digits 1.at n=17A147758
• Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^17 = I.at n=17A168680
• Partial sums of A173862.at n=47A200672
• Odd numbers that are not of the form p + 2^a + 2^b with b > a > 0, and p prime.at n=18A268693
• Odd numbers n that are neither of the form p + 2^a + 2^b nor of the form p - 2^a - 2^b with 2^a + 2^b < n, b > a > 0, and p prime.at n=5A268695
• Numbers all of whose divisors are binary palindromes (A329419) with a record number of divisors.at n=8A329420
• Numbers all of whose divisors, excluding the divisor 1, are evil numbers (A001969) with a record number of divisors.at n=8A338611
• a(2*k) = 3*2^k - 3, a(2*k+1) = 2^(k+2) - 3.at n=32A354788
• a(n) = (1/phi(n)) * Sum_{j=1..n} Sum_{k=1..n} phi(n*j*k).at n=31A372668
• a(n) is the number of paths of a chess king on square a1 to reach a position outside an 8 X 8 chessboard after n steps.at n=7A378902