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.

A007601 Positions where A007600 increases.

This page as a plain text file.
%I A007601 M0525 #25 Aug 25 2025 04:30:03
%S A007601 1,2,3,4,5,7,10,13,19,28,37,55,82,109,163,244,325,487,730,973,1459,
%T A007601 2188,2917,4375,6562,8749,13123,19684,26245,39367,59050,78733,118099,
%U A007601 177148,236197,354295,531442,708589,1062883,1594324,2125765,3188647
%N A007601 Positions where A007600 increases.
%D A007601 R. Honsberger, Mathematical Gems III, M.A.A., 1985, p. 225.
%D A007601 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007601 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KatonasProblem.html">Katona's Problem</a>
%F A007601 a(n) = A000792(n-1)+1 for n>1. - _Harry Altman_, May 17 2011
%t A007601 f[n_] := Min[ Table[2p + 3Ceiling[Log[3, n/2^p]], {p, 0, 2}]]; g[1] = 1; g[n_] := g[n] = Block[{k = g[n - 1]}, While[ f[k] != n, k++ ]; k]; Table[ g[n], {n, 2, 15}] (* _Robert G. Wilson v_, Jan 15 2005 *)
%Y A007601 Cf. A000792.
%K A007601 nonn,easy,changed
%O A007601 1,2
%A A007601 _N. J. A. Sloane_, _Robert G. Wilson v_, and _Mira Bernstein_
%E A007601 More terms from _Robert G. Wilson v_, Jan 15 2005