This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A110138 #14 Jun 01 2023 17:00:47 %S A110138 1,1,1,2,4,9,27,64,256,625,3125,7776,46656,117649,823543,2097152, %T A110138 16777216,43046721,387420489,1000000000,10000000000,25937424601, %U A110138 285311670611,743008370688,8916100448256,23298085122481,302875106592253,793714773254144,11112006825558016 %N A110138 a(n) = ceiling(n/2)^floor(n/2). %C A110138 a(n) is the number of partitions of [n] such that each block has exactly one odd element: a(5) = 9: 124|3|5, 12|34|5, 12|3|45, 14|23|5, 1|234|5, 1|23|45, 14|25|3, 1|245|3, 1|25|34. - _Alois P. Heinz_, Jun 01 2023 %H A110138 Alois P. Heinz, <a href="/A110138/b110138.txt">Table of n, a(n) for n = 0..773</a> %F A110138 a(2n) = A110132(2n) = A000312(n). %o A110138 (Python) %o A110138 def A110138(n): return ((m:=n>>1)+(n&1))**m # _Chai Wah Wu_, Jan 18 2023 %Y A110138 Cf. A000312, A110132. %K A110138 easy,nonn %O A110138 0,4 %A A110138 _Paul Barry_, Jul 13 2005