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.

A061390 Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2.

This page as a plain text file.
%I A061390 #9 Feb 11 2023 22:26:50
%S A061390 3,5,7,14,38,172,823,6185,87223,1940494
%N A061390 Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2.
%C A061390 Some values calculated by Joseph Devincentis.
%C A061390 a(11) > 5000000. - _David Wasserman_, Jun 21 2002
%H A061390 Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0501.html">Math. Magic</a>
%Y A061390 Cf. A047984.
%K A061390 nonn,more
%O A061390 1,1
%A A061390 _Jason Earls_, Jun 09 2001
%E A061390 More terms from _David Wasserman_, Jun 21 2002