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.

Original entry on oeis.org

1, 2, 7, 24, 72, 203, 564, 1556, 4274, 11709, 32021, 87463, 238691
Offset: 0

Views

Author

David A. Corneth, Feb 20 2021

Keywords

Comments

Conjecture: Starting at 7, terms coincide with A309237 - 1. - Hugo Pfoertner, Feb 21 2021

Examples

			a(4) = 24 as A076620(24) = 4 while A076620(k) < 4 for k < 24.
		

Crossrefs

Cf. A076620.

Programs

  • Mathematica
    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 *)
  • 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 }

Formula

a(n) ~ c*e^n.