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.

A248635 Numbers k such that A248633(k+1) = A248633(k) + 2.

This page as a plain text file.
%I A248635 #7 Oct 17 2014 23:19:17
%S A248635 1,2,3,4,6,7,9,10,12,14,15,17,19,21,22,24,26,28,30,32,33,35,37,39,41,
%T A248635 43,45,47,48,50,52,54,56,58,60,62,64,66,68,69,71,73,75,77,79,81,83,85,
%U A248635 87,89,91,93,95,97,99,100,102,104,106,108,110,112,114,116
%N A248635 Numbers k such that A248633(k+1) = A248633(k) + 2.
%H A248635 Clark Kimberling, <a href="/A248635/b248635.txt">Table of n, a(n) for n = 1..500</a>
%e A248635 (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 A248635 z= 300; p[k_] := p[k] = Sum[(h^2/4^h), {h, 1, k}];
%t A248635 d = N[Table[20/27 - p[k], {k, 1, z/5}], 12];
%t A248635 f[n_] := f[n] = Select[Range[z], 20/27 - p[#] < 1/8^n &, 1];
%t A248635 u = Flatten[Table[f[n], {n, 1, z}]]  (* A248633 *)
%t A248635 d = Differences[u]
%t A248635 Flatten[Position[d, 1]]  (* A248634 *)
%t A248635 Flatten[Position[d, 2]]  (* A248635 *)
%Y A248635 Cf. A248633, A248634, A248630.
%K A248635 nonn,easy
%O A248635 1,2
%A A248635 _Clark Kimberling_, Oct 11 2014