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.

A035932 Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".

This page as a plain text file.
%I A035932 #19 Dec 22 2019 11:50:21
%S A035932 0,1,11,26,39,77,117,139,449,529,777,1117,2229,2982,4267,4779,5319,
%T A035932 5919,8693,12699,14119,17907,27779,47877,80299,103199,135199,274834,
%U A035932 293938,312794,606963,653993,773989,1160892,1296741,1616696,1986576
%N A035932 Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".
%H A035932 Giovanni Resta, <a href="/A035932/b035932.txt">Table of n, a(n) for n = 0..100</a> (terms 0..50 from Scott R. Shannon)
%H A035932 Scott R. Shannon, <a href="/A035932/a035932.txt">The 50 steps to 0 for start value n = 74438327</a>.
%Y A035932 Cf. A035930, A035931, A035933, A035934, A035935.
%K A035932 nonn,base,nice
%O A035932 0,3
%A A035932 _Erich Friedman_
%E A035932 More terms from _Naohiro Nomoto_, Apr 03 2001