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.

A362462 Indices of 1's in A362460.

This page as a plain text file.
%I A362462 #12 May 11 2023 05:30:03
%S A362462 1,2,6,7,8,12,14,17,20,21,23,26,27,28,31,32,33,35,36,38,39,41,44,45,
%T A362462 46,47,50,51,53,54,56,58,60,61,62,63,65,67,68,69,73,74,75,76,77,78,83,
%U A362462 84,85,86,87,88,89,90,91,95,97,101,103,104,106,108,109,111,112,116,117,122,123,124,125,127,128,129,130,131,135
%N A362462 Indices of 1's in A362460.
%H A362462 Rémy Sigrist, <a href="/A362462/b362462.txt">Table of n, a(n) for n = 1..10000</a>
%H A362462 Rémy Sigrist, <a href="/A362462/a362462.txt">C program</a>
%t A362462 A000959[upto_]:=Module[{s=2,a=Range[1,upto,2]},While[s<Length[a]&&a[[s]]<=Length[a],a=Drop[a,{a[[s]],-1,a[[s++]]}]];a];
%t A362462 A362462[upto_]:=Module[{d=A000959[upto]},Table[If[First[d=Abs[Differences[d]]]==2,n,Nothing],{n,Length[d]-1}]];
%t A362462 A362462[2000] (* Uses lucky numbers up to 2000 *) (* _Paolo Xausa_, May 11 2023 *)
%o A362462 (C) See Links section.
%Y A362462 Cf. A362460, A362461.
%K A362462 nonn
%O A362462 1,2
%A A362462 _N. J. A. Sloane_, May 07 2023