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 A378269 #18 Dec 27 2024 02:55:03
%S A378269 1,2,3,4,7,8,9,28,29,30,90,91,150,294,295,296,659,2818,2819,4815,4816,
%T A378269 4817,26648,26649,38880,55745,55746,247660,322628,322629,322630,
%U A378269 1942493,7597991,7597992
%N A378269 Number of partitions of 1 into {1/1, 1/3, 1/5, ..., 1/(2*n-1)}.
%H A378269 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F A378269 If 2*n-1 is prime, then a(n) = a(n-1) + 1. - _Chai Wah Wu_, Dec 26 2024
%e A378269 a(5) = 7 because we have 9 * (1/9) = 6 * (1/9) + 1/3 = 3 * (1/9) + 2 * (1/3) = 7 * (1/7) = 5 * (1/5) = 3 * (1/3) = 1.
%Y A378269 Cf. A005408, A020473, A038034.
%K A378269 nonn,more
%O A378269 1,2
%A A378269 _Ilya Gutkovskiy_, Nov 21 2024
%E A378269 a(20)-a(34) from _Jinyuan Wang_, Dec 11 2024