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.

A383425 Indices k such that A003849(k) = 0 and A383422(k) = 1.

This page as a plain text file.
%I A383425 #11 May 07 2025 01:01:15
%S A383425 2,5,8,13,16,20,23,24,26,31,34,37,41,42,45,49,52,55,60,63,66,70,71,73,
%T A383425 78,81,84,89,92,96,99,100,102,107,110,113,117,118,121,125,128,131,136,
%U A383425 139,143,146,147,149,154,157,160,164,165,168,172,175,176,178
%N A383425 Indices k such that A003849(k) = 0 and A383422(k) = 1.
%C A383425 The positive integers are partitioned by this sequence together with A383423, A383424, and A383426.
%C A383425 Conjecture: {a(n) - a(n-1), n>=2} = {1, 2, 3, 4, 5}.
%t A383425 wF = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 15];  (* A003849 *)
%t A383425 s[0] = "0"; s[1] = "011"; s[n_] := StringJoin[s[n - 1], s[n - 2]]; (* A383422 *)
%t A383425 wL = Join[{0}, IntegerDigits[FromDigits[s[15]]]];
%t A383425 -1+Select[Range[400], wF[[#]] == 0 && wL[[#]] == 1 &]
%Y A383425 Cf. A003849, A383422, A383423, A383424, A383426, A383427.
%K A383425 nonn
%O A383425 1,1
%A A383425 _Clark Kimberling_, Apr 27 2025