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 A217329 #4 Sep 30 2012 18:08:13 %S A217329 3,23,29,61,71,107,109,157,167,211,233,263,313,313,347,373,383,401, %T A217329 433,449,487,487,499,563,601,619,661,673,691,733,743,787,827,839,863, %U A217329 937,983,1031,1061,1103,1117,1153,1213,1213,1279,1291,1321,1427,1481,1543 %N A217329 Esumprimes: prime(k), where k is the sum of the first n digits of E. %C A217329 The digits of E are added d_1+d_2. . d_i and the prime whose index is the i-th sum is chosen. E.g., for E = 2.718281828 . . . the first Esumprime is prime(2), the second is prime(9), the third is prime(10), etc. %H A217329 Harvey P. Dale, <a href="/A217329/b217329.txt">Table of n, a(n) for n = 1..1000</a> %e A217329 See Comments. %t A217329 Prime[#]&/@Accumulate[RealDigits[E,10,60][[1]]] %Y A217329 Cf. A076787, A076789. %K A217329 easy,nonn,base %O A217329 1,1 %A A217329 _Harvey P. Dale_, Sep 30 2012