28489

Appears in sequences

• Minimal peaks in digital expansions of Pi: positions of peaks equal to 1.at n=30A105275
• Number of partitions of 1, 2, 3, or more copies of n into distinct parts.at n=21A258289
• Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=4A264474
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=49A264476
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=5A264479
• a(n) = floor(1/(1-s(n))) where s(n) = Sum_{k=1..n} phi(k)/k * log(2^k/(2^k-1)). phi(k) is the Euler totient function A000010(k).at n=13A383024