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.

A381111 Least k such that A381110(k) = n.

This page as a plain text file.
%I A381111 #8 Feb 17 2025 01:59:33
%S A381111 0,1,4,6,8,18,26,35,40,45,50,55,99,107,115,123,136,157,234,247,260,
%T A381111 273,286,299,312,325,338,351,364,377,633,654,675,696,717,738,759,780,
%U A381111 801,822,843,869,890,911,932,966,1021,1598,1632,1666,1700,1734,1768,1802
%N A381111 Least k such that A381110(k) = n.
%H A381111 Pontus von Brömssen, <a href="/A381111/b381111.txt">Table of n, a(n) for n = 1..350</a>
%H A381111 Pontus von Brömssen, <a href="/A381111/a381111.png">Illustration for n=1..7</a>.
%Y A381111 Cf. A376488, A381110.
%K A381111 nonn
%O A381111 1,3
%A A381111 _Pontus von Brömssen_, Feb 14 2025