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.
%I A162908 #3 Mar 30 2012 18:52:33 %S A162908 2,3,2,4,2,5,3,4,2,7,3,5,3,6,4,5,3,7,2,11,4,6,2,13,3,9,4,7,5,6,4,8,3, %T A162908 11,2,17,5,7,2,19,3,13,5,8,6,7,4,11,5,9,2,23,6,8,5,10,3,17,4,13,6,9,5, %U A162908 11,7,8,3,19,2,29,6,10,2,31,7,9,5,13,6,11,4,17,3,23,7,10,8,9,2,37,5,15,4,19 %N A162908 Pairs of central divisors of A089229(n). %C A162908 The central divisors are the two complementary divisors closest to the square %C A162908 root of a number, as tabulated in A162348. %F A162908 a(2n-1)= A033676(A089229(n)). a(2n)=A033677(A089229(n)). - R. J. Mathar, Jul 19 2009 %e A162908 a(1)=2 and a(2)=3 since A089229(1)=6 with divisors 1, 2, 3, 4. %e A162908 a(3)=2 and a(4)=4 since A089229(2)=8 with divisors 1, 2, 4, 8. %e A162908 a(5)=2 and a(6)=5 since A089229(3)=10 with divisors 1, 2, 5, 10. %Y A162908 Cf. A089229, A162361. %K A162908 nonn,easy %O A162908 1,1 %A A162908 _Juri-Stepan Gerasimov_, Jul 17 2009 %E A162908 Missing pairs inserted by _R. J. Mathar_, Jul 19 2009