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.

A305235 Smallest positive number k such that there are exactly n successive equal values of A001221 starting at k, i.e., such that A305234(k) = n.

This page as a plain text file.
%I A305235 #17 Jun 23 2025 00:43:12
%S A305235 1,4,3,2,54,91,142,141,44360,48919,218972,526097,526096,526095,
%T A305235 17233173,127890362,29138958036,118968284929,118968284928,
%U A305235 585927201065,585927201064,585927201063,585927201062,313978488186061,453918847597185,453918847597184,455626105596320
%N A305235 Smallest positive number k such that there are exactly n successive equal values of A001221 starting at k, i.e., such that A305234(k) = n.
%C A305235 a(27) > 2 * 10^15. - _Toshitaka Suzuki_, Jun 22 2025
%e A305235 For n = 5: A001221(91+k) = 2 for k = 0..5 and 91 is the smallest number x with exactly 5 successors that have the same value of A001221 as x, so a(5) = 91.
%o A305235 (PARI) a305234(n) = my(k=n+1, i=0); while(omega(k)==omega(n), i++; k++); i
%o A305235 a(n) = my(k=1); while(1, if(a305234(k)==n, return(k)); k++)
%Y A305235 Cf. A001221, A001274, A045983, A048932, A048971, A077657, A305234.
%K A305235 nonn
%O A305235 0,2
%A A305235 _Felix Fröhlich_, May 28 2018
%E A305235 a(16)-a(22) from _Toshitaka Suzuki_, Apr 01 2025
%E A305235 a(23)-a(26) from _Toshitaka Suzuki_, Jun 22 2025