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.

A086957 Smallest m with A086956(m)=n.

This page as a plain text file.
%I A086957 #3 Mar 30 2012 18:50:37
%S A086957 1,4,9,16,5,18,7,32,27,50,11,72,13,28,75,64,17,108,19,100,63,44,23,
%T A086957 192,125,52,81,196,29,180,31,128,99,68,35,288,37,76,117,200,41,294,43,
%U A086957 176,225,92,47,384,49,250,153,208,53,486,55,392,171,116,59,420,61
%N A086957 Smallest m with A086956(m)=n.
%C A086957 a(n) < A086958(n) < A086959(n), A086956(a(n))=A086956(A086958(n))=A086956(A086959(n));
%C A086957 n and A086956(n) are divisors of a(n);
%C A086957 A086960(a(n)) = A086958(n), A086960(A086959(n)) = a(n);
%C A086957 A086961(a(n)) = A086959(n), A086961(A086958(n)) = a(n);
%C A086957 A086962(a(n)) = a(n);
%C A086957 A086963(a(n)) = A086959(n), A086963(A086959(n)) = a(n);
%C A086957 A086964(a(n)) = A086958(n), A086964(A086958(n)) = a(n).
%Y A086957 Cf. A086938, A086939.
%K A086957 nonn
%O A086957 1,2
%A A086957 _Reinhard Zumkeller_, Jul 25 2003