177744
domain: N
Appears in sequences
- Digits of sigma(n) end in phi(n).at n=26A067249
- Inverse binomial transform of A083589.at n=11A083591
- Numbers k such that abundance(k) = abundance(sigma(k)).at n=4A137210
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks of size 3, i.e., blocks of the form (i,i+1,i+2) (0 <= k <= floor(n/3)).at n=42A184176
- Smallest positive b such that for all k >= 1 the numbers n*b^k + 1 are composite and gcd(n+1, b-1) = 1, or 0 if n > 1 is of the form 2^m - 1.at n=6A263500
- Expansion of sqrt(1 + 4*x/sqrt(1 - 4*x)).at n=11A377239