login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A198852 a(n) = 4*8^n - 1. 2
3, 31, 255, 2047, 16383, 131071, 1048575, 8388607, 67108863, 536870911, 4294967295, 34359738367, 274877906943, 2199023255551, 17592186044415, 140737488355327, 1125899906842623, 9007199254740991, 72057594037927935 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

In base 8, the numbers of this sequence are written 37, 377, 3777, 37777, ... and satisfy the A052148 condition. - Michel Marcus, Aug 23 2013

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (9,-8).

FORMULA

a(n) = 8*a(n-1) + 7.

a(n) = 9*a(n-1) - 8*a(n-2) for n > 1.

G.f.: ( 3+4*x ) / ( (8*x-1)*(x-1) ). - R. J. Mathar, Oct 31 2011

a(n) = A013731(n) - 1. - Michel Marcus, Aug 23 2013

PROG

(Magma) [4*8^n-1: n in [0..30]];

CROSSREFS

Cf. A013731, A052148.

Sequence in context: A111400 A057972 A221821 * A114849 A221899 A242134

Adjacent sequences: A198849 A198850 A198851 * A198853 A198854 A198855

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Oct 31 2011

STATUS

approved

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 December 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)