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 A122970 #21 Sep 08 2022 08:45:28
%S A122970 0,1,536870912,68630377364883,288230376151711744,
%T A122970 186264514923095703125,36845653286788892983296,
%U A122970 3219905755813179726837607,154742504910672534362390528,4710128697246244834921603689,100000000000000000000000000000,1586309297171491574414436704891
%N A122970 29th powers: a(n) = n^29.
%C A122970 The least significant digit of a(n) is the same as the least significant digit of n. - _Alonso del Arte_, Mar 28 2015
%H A122970 Amiram Eldar, <a href="/A122970/b122970.txt">Table of n, a(n) for n = 0..10000</a>
%H A122970 <a href="/index/Di#divseq">Index to divisibility sequences</a>
%F A122970 Completely multiplicative sequence with a(p) = p^29 for prime p. Multiplicative sequence with a(p^e) = p^(29e). - _Jaroslav Krizek_, Nov 01 2009
%F A122970 From _Amiram Eldar_, Oct 09 2020: (Start)
%F A122970 Dirichlet g.f.: zeta(s-29).
%F A122970 Sum_{n>=1} 1/a(n) = zeta(29).
%F A122970 Sum_{n>=1} (-1)^(n+1)/a(n) = 268435455*zeta(29)/268435456. (End)
%t A122970 Range[0, 9]^29 (* _Alonso del Arte_, Mar 28 2015 *)
%o A122970 (Magma) [n^29: n in [0..10]]; // _Vincenzo Librandi_, Mar 29 2015
%o A122970 (PARI) a(n)=n^29 \\ _Charles R Greathouse IV_, Jun 28 2015
%Y A122970 Cf. A089081, A122968, A122969.
%K A122970 mult,nonn,easy
%O A122970 0,3
%A A122970 _Franklin T. Adams-Watters_, Oct 27 2006
%E A122970 a(10)-a(11) from _Michel Marcus_, Mar 29 2015