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.

A244743 Smallest number n with ||n-1||-||n|| = k where ||n||=A005245(n) denotes the complexity of n.

This page as a plain text file.
%I A244743 #18 May 06 2024 10:12:57
%S A244743 6,12,24,108,720,1440,81648,2041200,612360000
%N A244743 Smallest number n with ||n-1||-||n|| = k where ||n||=A005245(n) denotes the complexity of n.
%C A244743 The k-th term of this sequence is the least n with ||n-1||-||n|| = k if such an n exists.
%C A244743 It is conjectured that ||n-1||-||n|| is not bounded. But there is no proof that the sequence is infinite or is well defined.
%H A244743 J. Arias de Reyna and J. van de Lune, <a href="http://arxiv.org/abs/1404.1850">The question "How many 1's are needed?" revisited</a>, arXiv preprint arXiv:1404.1850 [math.NT], 2014.
%e A244743 ||719||=23, ||720||=19, therefore ||719||-||720||=4. This is the first time the difference 4 appears in this way. Hence a(4)=720.
%Y A244743 Cf. A005245, A252739 (see comments).
%K A244743 nonn,more
%O A244743 0,1
%A A244743 _Juan Arias-de-Reyna_, Jul 05 2014