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.

A348409 a(n) is the greatest k such that A307730(k) = n.

This page as a plain text file.
%I A348409 #14 Oct 21 2021 07:32:21
%S A348409 1,3,6,11,51,16,58,34,25,69,1384,45,1397,82,97,152,3754,115,3773,223,
%T A348409 135,1420,6702,175,344,1445,202,251,6731,374,84656,283,1479,3808,409,
%U A348409 318,84693,3845,1617,541,89520,451,89563,1523,689,6778,91878,589,500,1073
%N A348409 a(n) is the greatest k such that A307730(k) = n.
%H A348409 Rémy Sigrist, <a href="/A348409/b348409.txt">Table of n, a(n) for n = 1..10000</a>
%H A348409 Rémy Sigrist, <a href="/A348409/a348409.txt">C program for A348409</a>
%F A348409 a(n) - A348246(n) >= n - 1.
%e A348409 For n = 6:
%e A348409 - sequence A307730 starts: 1, 2, 2, 3, 3, 3, 6, 4, 4, 4, 4, 6, 6, 6, 6, 6,
%e A348409 - the sixth occurrence of 6 appears at position 16,
%e A348409 - so a(6) = 16.
%o A348409 (C) See Links section.
%Y A348409 Cf. A307720, A307730, A348246.
%Y A348409 Records: A348253, A348254.
%K A348409 nonn
%O A348409 1,2
%A A348409 _Rémy Sigrist_, Oct 17 2021