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.

A053237 Numbers n such that both A053230(n) and A053230(n+1) = 1.

This page as a plain text file.
%I A053237 #7 Oct 27 2023 22:00:45
%S A053237 1,31,38,67,74,98,128,197,228,240,247,277,283,307,313,332,339,369,382,
%T A053237 400,413,430,459,489,502,520,551,609,622,646,664,729,759,771,823,830,
%U A053237 843,908,915,940,969,1038,1057,1086,1117,1124,1148,1206,1247,1266,1290
%N A053237 Numbers n such that both A053230(n) and A053230(n+1) = 1.
%C A053237 Pairs of consecutive 1's occur uncommonly often in A053230.
%p A053237 with(numtheory): f := [seq( `if`((sigma(i+1) > sigma(i)),i,print( )), i=1..5000)];
%p A053237 seq(`if`((f[i+2]-f[i+1]=1) and (f[i+1]-f[i]=1),i,print( )), i=1..1500);
%Y A053237 Cf. A000203, A053224, A053230, A053231, A053232, A053233, A053234, A053235, A053236.
%K A053237 nonn
%O A053237 1,2
%A A053237 _Asher Auel_, Jan 10 2000