login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136308 (10^2^n-1)/9. 4
1, 11, 1111, 11111111, 1111111111111111, 11111111111111111111111111111111, 1111111111111111111111111111111111111111111111111111111111111111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

More generally, reading in base B >= 2:  a(n) = (B^2^n - 1)/(B-1).

Recurrence: a(n) = a(n-1)*(B^K +1); a(0)=1; K = floor(log_B a(n-1)) + 1.

B = 2 gives A051179; B = 3 gives A059918.

LINKS

Table of n, a(n) for n=0..6.

FORMULA

a(n) = a(n-1)*(10^K +1); a(0)=1; K=floor(log_10 a(n-1)) + 1.

Recurrence: a(n) = a(n-1)*(10^K +1); a(0)=1; K=floor(log_10 a(n-1)) + 1=2^n+1.

a(n) = A000042(A000079(n)) = A007088(A051179(n)) = A007089(A059918(n)).

PROG

(MAGMA) A136308 := func<n|(10^2^n-1)/9>; [A136308(n):n in[0..7]];

CROSSREFS

Cf. A051179, A059918.

Sequence in context: A099814 A260077 A068053 * A075600 A078568 A015095

Adjacent sequences:  A136305 A136306 A136307 * A136309 A136310 A136311

KEYWORD

easy,nonn

AUTHOR

Ctibor O. Zizka, Mar 22 2008

EXTENSIONS

Edited by Jason Kimberley, Dec 18 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified August 17 07:59 EDT 2017. Contains 290635 sequences.