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 A038152 #23 May 11 2024 15:40:56 %S A038152 23,46,69,92,115,138,161,185,208,231,254,277,300,323,347,370,393,416, %T A038152 439,462,485,509,532,555,578,601,624,647,671,694,717,740,763,786,809, %U A038152 833,856,879,902,925,948,971,995,1018,1041,1064 %N A038152 Beatty sequence for e^Pi. %H A038152 Paolo Xausa, <a href="/A038152/b038152.txt">Table of n, a(n) for n = 1..10000</a> %H A038152 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A038152 a(n) = floor(n*e^Pi). %p A038152 A038152:=n->floor(n*exp(Pi)): seq(A038152(n), n=1..100); # _Wesley Ivan Hurt_, Jan 21 2017 %t A038152 Floor[Range[100]*E^Pi] (* _Paolo Xausa_, May 11 2024 *) %o A038152 (PARI) a(n) = floor(n*exp(Pi)); \\ _Michel Marcus_, Sep 28 2013 %Y A038152 Cf. A000796, A001113, A039661. %K A038152 nonn,easy %O A038152 1,1 %A A038152 _Felice Russo_ %E A038152 Corrected and extended by _Carlos Alves_, Nov 25 2006