cp's OEIS Frontend

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.

A013792 a(n) = 10^(4*n + 1).

This page as a plain text file.
%I A013792 #24 Sep 07 2024 03:22:44
%S A013792 10,100000,1000000000,10000000000000,100000000000000000,
%T A013792 1000000000000000000000,10000000000000000000000000,
%U A013792 100000000000000000000000000000,1000000000000000000000000000000000,10000000000000000000000000000000000000,100000000000000000000000000000000000000000
%N A013792 a(n) = 10^(4*n + 1).
%H A013792 Vincenzo Librandi, <a href="/A013792/b013792.txt">Table of n, a(n) for n = 0..100</a>
%H A013792 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A013792 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (10000).
%F A013792 a(n) = 10000*a(n-1). - _Wesley Ivan Hurt_, Apr 19 2023
%F A013792 From _Elmo R. Oliveira_, Aug 30 2024: (Start)
%F A013792 G.f.: 10/(1 - 10000*x).
%F A013792 E.g.f.: 10*exp(10000*x).
%F A013792 a(n) = A011557(A016813(n)) = A098608(n)*A013715(n) = A013776(n)*A013782(n). (End)
%o A013792 (Magma) [10^(4*n+1): n in [0..10]]; // _Vincenzo Librandi_, Jun 28 2011
%Y A013792 Subsequence of A011557.
%Y A013792 Cf. A013715, A013776, A013782, A016813, A098608.
%K A013792 nonn,easy
%O A013792 0,1
%A A013792 _N. J. A. Sloane_