1866240

Appears in sequences

• Values of phi in arithmetic progression of at least 6 terms having the same value of phi in A050518.at n=11A050520
• Values of phi in arithmetic progression of at least 6 terms having the same value of phi in A050518.at n=12A050520
• Values of phi in arithmetic progression of at least 6 terms having the same value of phi in A050518.at n=13A050520
• Product of terms of continued fraction expansion of (3/2)^n.at n=32A071337
• Given a row of n payphones (or phone booths), all initially unused, sequence gives number of ways for n people to choose the payphones assuming each always chooses one of the most distant payphones from those in use already.at n=14A095236
• Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.at n=6A159733
• The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal sum (= A259280(n)).at n=18A283558
• For any number n > 0, let f(n) be the polynomial of a single indeterminate x where the coefficient of x^e is the prime(1+e)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the polynomials of a single indeterminate x with nonnegative integer coefficients; let g be the inverse of f; a(n) = g(f(n)^2).at n=23A297473
• a(0) = 1; for n > 0, a(n) = A000120(n) * a(n-A000120(n)), where A000120(n) is the binary weight of n.at n=46A320008
• Read terms e = T(n,k) in A333624 as Product(prime(k)^e) for n in A334556.at n=23A333625
• Read terms e = T(n,k) in A333624 as Product(prime(k)^e) for n in A334556.at n=30A333625
• Read terms e = T(n,k) in A333624 as Product(prime(k)^e) for n in A334769.at n=10A334896
• Read terms e = T(n,k) in A333624 as Product(prime(k)^e) for n in A334769.at n=13A334896