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.

A248632 Numbers k such that A248631(k+1) = A248631(k).

This page as a plain text file.
%I A248632 #4 Oct 15 2014 21:00:12
%S A248632 6,10,14,17,21,24,27,30,33,36,39,42,45,48,51,54,57,60,63,66,69,72,75,
%T A248632 77,80,83,86,89,92,95,97,100,103,106,109,111,114,117,120,123,126,128,
%U A248632 131,134,137,140,142,145,148,151,154,156,159,162,165,168,170,173
%N A248632 Numbers k such that A248631(k+1) = A248631(k).
%H A248632 Clark Kimberling, <a href="/A248632/b248632.txt">Table of n, a(n) for n = 1..300</a>
%e A248632 (A248631(k+1) = A248631(k)) = (1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1,... ), so that A248632 = (6, 10, 14, ... ).
%t A248632 z = 200; p[k_] := p[k] = Sum[(h^2/2^h), {h, 1, k}];
%t A248632 d = N[Table[6 - p[k], {k, 1, z/5}], 12];
%t A248632 f[n_] := f[n] = Select[Range[z], 6 - p[#] < 1/3^n &, 1];
%t A248632 u = Flatten[Table[f[n], {n, 1, z}]]; (* A248629 *)
%t A248632 d = Differences[u];
%t A248632 Flatten[Position[d, 1]];  (* A248630 *)
%Y A248632 Cf. A248631, A248630.
%K A248632 nonn,easy
%O A248632 1,1
%A A248632 _Clark Kimberling_, Oct 11 2014