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.

A086959 Greatest m with A086956(m)=n.

This page as a plain text file.
%I A086959 #3 Mar 30 2012 18:50:37
%S A086959 3,8,15,24,25,36,21,48,54,70,33,96,39,56,105,112,51,144,57,140,168,88,
%T A086959 69,240,175,104,162,252,87,270,93,256,165,136,280,360,111,152,195,400,
%U A086959 123,378,129,264,405,184,141,480,343,350,255,312,159,594,275,504
%N A086959 Greatest m with A086956(m)=n.
%C A086959 A086957(n) < A086958(n) < a(n), A086956(a(n))=A086956(A086957(n))=A086956(A086958(n));
%C A086959 n and A086956(n) are divisors of a(n);
%C A086959 A086960(A086958(n)) = a(n), A086960(a(n)) = A086957(n);
%C A086959 A086961(A086957(n)) = a(n), A086961(a(n)) = A086958(n);
%C A086959 A086962(A086958(n)) = a(n), A086962(a(n)) = A086958(n);
%C A086959 A086963(A086957(n)) = a(n), A086963(a(n)) = A086957(n);
%C A086959 A086964(a(n)) = a(n).
%Y A086959 Cf. A086938, A086939.
%K A086959 nonn
%O A086959 1,1
%A A086959 _Reinhard Zumkeller_, Jul 25 2003