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.

A341803 a(n) is the least k such that A076620(k) = n.

This page as a plain text file.
%I A341803 #16 Mar 07 2021 01:21:05
%S A341803 1,2,7,24,72,203,564,1556,4274,11709,32021,87463,238691
%N A341803 a(n) is the least k such that A076620(k) = n.
%C A341803 Conjecture: Starting at 7, terms coincide with A309237 - 1. - _Hugo Pfoertner_, Feb 21 2021
%F A341803 a(n) ~ c*e^n.
%e A341803 a(4) = 24 as A076620(24) = 4 while A076620(k) < 4 for k < 24.
%t A341803 With[{s = Array[-1 + FirstPosition[#, Max[#]][[1]] &@ CoefficientList[Pochhammer[x, #]/x, x] &, 600]}, {1}~Join~Array[-1 + FirstPosition[s, #][[1]] &, Max@ s]] (* _Michael De Vlieger_, Feb 22 2021 *)
%o A341803 (PARI) first(n) = {res = vector(n); res[1] = 1; my(r = 1); print1(1", "); v = [1]; for(i = 1, oo, v = concat(0, v) + concat(v, 0)*i; if(#v > n, v = v[^-1]; ); for(j = r + 1, #v, if(v[j] > v[j - 1], r++; res[r] = i; print1(i", "); if(r >= n, return(res); ) , next ))); res }
%Y A341803 Cf. A076620.
%K A341803 nonn,more
%O A341803 0,2
%A A341803 _David A. Corneth_, Feb 20 2021