cp's OEIS Frontend

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.

A343522 Lexicographically least strictly increasing sequence such that, for any n > 0, Sum_{k = 1..n} 1/a(k) can be computed without carries in factorial base.

This page as a plain text file.
%I A343522 #8 Apr 20 2021 02:40:59
%S A343522 1,2,3,7,45,631,399168,97044480,55794106368
%N A343522 Lexicographically least strictly increasing sequence such that, for any n > 0, Sum_{k = 1..n} 1/a(k) can be computed without carries in factorial base.
%C A343522 This sequence is infinite as factorial base expansions of rational numbers are terminating.
%C A343522 In decimal base, we would end after four terms: 1, 2, 3, 6.
%H A343522 Rémy Sigrist, <a href="/A343522/a343522.gp.txt">PARI program for A343522</a>
%H A343522 Wikipedia, <a href="https://en.wikipedia.org/wiki/Factorial_number_system#Fractional_values">Factorial number system (Fractional values)</a>
%H A343522 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A343522 Sum_{k = 1..n} 1/a(n) < 2.
%e A343522 The first terms, alongside the factorial base expansion of 1/a(n), are:
%e A343522    n  a(n)  fact(1/a(n))
%e A343522    -  ----  ------------------
%e A343522    1     1  1
%e A343522    2     2  0.1
%e A343522    3     3  0.0 2
%e A343522    4     7  0.0 0 3 2 0 6
%e A343522    5    45  0.0 0 0 2 4
%o A343522 (PARI) See Links section.
%Y A343522 Cf. A294168, A279732.
%K A343522 nonn,base,more,hard
%O A343522 1,2
%A A343522 _Rémy Sigrist_, Apr 18 2021