64101
domain: N
Appears in sequences
- a(n) is the smallest number m such that phi(10^n + m) = 10^n.at n=8A097650
- Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element x in S(n-1). a(n) is the number of elements in S(n).at n=22A122554
- Number of chordless cycles in the n-Moebius ladder.at n=22A297667