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.

A057926 a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.

This page as a plain text file.
%I A057926 #1 May 16 2003 03:00:00
%S A057926 1,3,4,8,5,10,16,11,20,32,21,34,24,35,28,64,29,66,32,67,36,72,37,74,
%T A057926 48,75,52,128,53,130,56,131,60,192,61,194,256,195,260,200,261,202,272,
%U A057926 203,276,224,277,226,280,227,284,512,285,514,288,515,292,520,293,522,304
%N A057926 a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.
%e A057926 See example in A051145.
%Y A057926 Cf. A051145, A057927, A057928.
%K A057926 easy,nonn
%O A057926 0,2
%A A057926 Larry Reeves (larryr(AT)acm.org), Oct 03 2000