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.

A248634 Numbers k such that A248633(k+1) = A248633(k) + 1.

This page as a plain text file.
%I A248634 #7 Oct 17 2014 23:19:05
%S A248634 5,8,11,13,16,18,20,23,25,27,29,31,34,36,38,40,42,44,46,49,51,53,55,
%T A248634 57,59,61,63,65,67,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,101,
%U A248634 103,105,107,109,111,113,115,117,119,121,123,125,127,129,131,133
%N A248634 Numbers k such that A248633(k+1) = A248633(k) + 1.
%H A248634 Clark Kimberling, <a href="/A248634/b248634.txt">Table of n, a(n) for n = 1..500</a>
%e A248634 (A248633(k+1) = A248633(k)) = (2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1,... ), so that A248634 = (5, 8, 11, 13, ... ) and A248635 = (1, 2, 3, 4, 6, 7, 9, 10, 12, ...).
%t A248634 z= 300; p[k_] := p[k] = Sum[(h^2/4^h), {h, 1, k}];
%t A248634 d = N[Table[20/27 - p[k], {k, 1, z/5}], 12];
%t A248634 f[n_] := f[n] = Select[Range[z], 20/27 - p[#] < 1/8^n &, 1];
%t A248634 u = Flatten[Table[f[n], {n, 1, z}]]  (* A248633 *)
%t A248634 d = Differences[u]
%t A248634 Flatten[Position[d, 1]]  (* A248634 *)
%t A248634 Flatten[Position[d, 2]]  (* A248635 *)
%Y A248634 Cf. A248633, A248635, A248630.
%K A248634 nonn,easy
%O A248634 1,1
%A A248634 _Clark Kimberling_, Oct 11 2014