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 A141569 #3 Mar 30 2012 18:52:27 %S A141569 4,6,8,46656,10,48,14,1679616,262144,60,20,373248,22,84,80,10077696, %T A141569 27,1572864,30,466560,112,120,35,13436928,1000000,132,16777216,653184, %U A141569 44,480,46,60466176,160,162,140,12230590464,54,180,176,16796160,58,672,62 %N A141569 Bases and exponents in the prime decomposition of n replaced by composites with these indices. %C A141569 Start from the prime decomposition of n, not writing down exponents which equal 1. That is the list 1, 2, 3, 2^2, 5, 2*3, 7, 2^3, 3^2, 2*5, 11, 2^2*3,.. Replace each number i in this representation by the i-th composite c(i)=A002808(i). This generates the sequence of a(n), namely c(1), c(2), c(3), c(2)^c(2), c(5), c(2)*c(3), c(7), c(2)^c(3), c(3)^c(2), c(2)*c(5), c(11), c(2)^c(2)*c(3),... %Y A141569 Cf. A000040, A002808. %K A141569 nonn %O A141569 1,1 %A A141569 _Juri-Stepan Gerasimov_, Aug 17 2008 %E A141569 Edited and corrected by _R. J. Mathar_, Aug 21 2008