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 A139025 #3 Mar 30 2012 17:26:27 %S A139025 4,7,14,23,84,107,120,135,172,183,234,283,396,433,446,519,588,617,638, %T A139025 661,680,695,706,725,758,783,854,891,1000,1043,1064,1119,1226,1283, %U A139025 1458,1469,1490,1521,1618,1661,1708,1765,2046,2157,2224,2333,2428,2507,2516 %N A139025 This is to A014688 as A014688 to A000027, see comments for definition. %C A139025 Take some initial sequence s1 = a(1), a(2),... %C A139025 then for new sequence s2 = b(1), b(2),.. we define %C A139025 b(n) = n + (n-th prime in s1). %C A139025 If s1 = A000027 then we clearly get A014688. %C A139025 If s1 = A014688 = 3,5,8,11,16,19,24,27,32,39,42,49,54,57,62,69,76,79,86,91,94 %C A139025 then b(1) = 1 + 3 (because 3 is the first prime in s1) %C A139025 b(2) = 2 + 5 (because 5 is the 2nd prime in s1) %C A139025 b(3) = 3 + 11 (because 11 is the 3rd prime in s1) %C A139025 b(4) = 4 + 19 (because 19 is the 4th prime in s1) %C A139025 b(5) = 5 + 79 (because 79 is the 5th prime in s1), %C A139025 resulting sequence is A139025 %C A139025 Repeating the same procedure we have next sequences: %C A139025 A139026: 8,25,110,287,438,623,668,1291,2342,2813,3790,3863,4230,4663,4828,6377,7468 %C A139025 A139027: 1292,3865,4666,8973,13936,50339,57266,67597,72316,85343,110934,132941,147990 %C A139025 A139028:270240,375255,635282,1000695,2039428,2602013,3398274,3748771,4300120 %C A139025 A139029:43448724,59672019,102128690,113904945,145135734,169755139 %F A139025 A139025(n)=n+A061068(n) %Y A139025 Cf. A000027, A014688, A061068, A139026-A139029. %K A139025 nonn %O A139025 1,1 %A A139025 _Zak Seidov_, Apr 07 2008