The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062397 a(n) = 10^n + 1. 39

%I #52 Sep 08 2022 08:45:03

%S 2,11,101,1001,10001,100001,1000001,10000001,100000001,1000000001,

%T 10000000001,100000000001,1000000000001,10000000000001,

%U 100000000000001,1000000000000001,10000000000000001,100000000000000001

%N a(n) = 10^n + 1.

%C The first three terms (indices 0, 1 and 2) are the only known primes. Moreover, the terms not of the form a(2^k) are all composite, except for a(0). Indeed, for all n >= 0, a(2n+1) is divisible by 11, a(4n+2) is divisible by 101, a(8n+4) is divisible by 73, a(16n+8) is divisible by 17, a(32n+16) is divisible by 353, a(64n+32) is divisible by 19841, etc. - _M. F. Hasler_, Nov 03 2018 [Edited based on the comment by _Jeppe Stig Nielsen_, Oct 17 2019]

%C This sequence also results when each term is generated by converting the previous term into a Roman numeral, then replacing each letter with its corresponding decimal value, provided that the vinculum is used and numerals are written in a specific way for integers greater than 3999, e.g., IV with a vinculum over the I and V for 4000. - _Jamie Robert Creasey_, Apr 14 2021

%H Vincenzo Librandi, <a href="/A062397/b062397.txt">Table of n, a(n) for n = 0..200</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).

%F a(n) = 10*a(n-1) - 9 = A011557(n) + 1 = A002283(n) + 2.

%F From _Mohammad K. Azarian_, Jan 02 2009: (Start)

%F G.f.: 1/(1-x) + 1/(1-10*x).

%F E.g.f.: exp(x) + exp(10*x). (End)

%t LinearRecurrence[{11, -10},{2, 11},18] (* _Ray Chandler_, Aug 26 2015 *)

%t 10^Range[0,20]+1 (* _Harvey P. Dale_, Jan 21 2020 *)

%o (Magma) [10^n + 1: n in [0..35]]; // _Vincenzo Librandi_, Apr 30 2011

%o (PARI) a(n)=10^n+1 \\ _Charles R Greathouse IV_, Sep 24 2015

%Y Except for the initial term, essentially the same as A000533. Cf. A054977, A007395, A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A063481, A074600-A074624, A034524, A178248, A228081 for numbers one more than powers, i.e., this sequence translated from base n (> 2) to base 10.

%Y Cf. A002283, A011557.

%Y Cf. A038371 (smallest prime factor), A185121.

%K easy,nonn

%O 0,1

%A _Henry Bottomley_, Jun 22 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 08:32 EDT 2024. Contains 373054 sequences. (Running on oeis4.)