139345920
domain: N
Appears in sequences
- Ratios of successive terms are 1,2,2,3,4,4,5,6,6,...at n=13A004527
- a(1) = 1, a(n) = smallest multiple of n divisible by the sum of all previous terms.at n=14A074179
- Product{<n/k>: k=1,2,...,n}, where <x> denotes the integer second nearest to x. (For x=(2h+1)/2, <x> is defined to be h, not h+1; if x is an integer, then <x> is defined to be x+1.)at n=18A075998
- a(n) = Product_{k=1..n, gcd(k,n)=1} (1+k).at n=23A131553
- Numbers that reach 1 under the iterations of the map k -> k/d(k) if d(k) | k, and k -> k otherwise, where d(k) is the number of divisors of k (A000005).at n=20A330816
- A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.at n=16A362192