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.

A292924 a(n) is the least k such that A122953(k) = n.

This page as a plain text file.
%I A292924 #20 Mar 10 2018 12:08:26
%S A292924 1,2,4,6,11,12,22,24,28,44,52,56,88,92,112,116,186,184,220,232,244,
%T A292924 368,376,440,472,488,744,752,880,888,976,984,1504,1512,1780,1776,1912,
%U A292924 1968,2008,3024,3048,3552,3568,3824,3952,4016,6064,6096,7112,7136,7648,7664
%N A292924 a(n) is the least k such that A122953(k) = n.
%C A292924 All positive terms of A112510 belong to this sequence.
%C A292924 The first known odd terms are a(1) = 1, a(5) = 11 and a(77) = 61321.
%C A292924 The sequence is not strictly increasing; for example a(17) = 186 and a(18) = 184.
%C A292924 The binary plot of the first terms has interesting features (see Links section).
%H A292924 Rémy Sigrist, <a href="/A292924/b292924.txt">Table of n, a(n) for n = 1..288</a>
%H A292924 Rémy Sigrist, <a href="/A292924/a292924.png">Binary plot of the first 288 terms</a>
%H A292924 Rémy Sigrist, <a href="/A292924/a292924.txt">C++ program for A292924</a>
%e A292924 The first occurrence of 6 in A122953 is A122953(12) = 6, hence a(6) = 12.
%o A292924 (C++) See Links section.
%Y A292924 Cf. A112510, A122953.
%K A292924 nonn,base
%O A292924 1,2
%A A292924 _Rémy Sigrist_, Mar 09 2018