login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029748 2^n times 1, 3 or 7. 1
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 24, 28, 32, 48, 56, 64, 96, 112, 128, 192, 224, 256, 384, 448, 512, 768, 896, 1024, 1536, 1792, 2048, 3072, 3584, 4096, 6144, 7168, 8192, 12288, 14336, 16384, 24576, 28672, 32768, 49152, 57344, 65536, 98304, 114688, 131072 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (0,0,2).

FORMULA

a(n) = 2*a(n-3) for n>5. G.f.: -(x^5+2*x^4+2*x^3+3*x^2+2*x+1) / (2*x^3-1). - Colin Barker, Jul 19 2013

MATHEMATICA

CoefficientList[Series[-(x^5 + 2 x^4 + 2 x^3 + 3 x^2 + 2 x + 1)/(2 x^3 - 1), {x, 0, 50}], x] (* Vincenzo Librandi, Oct 18 2013 *)

Sort[Flatten[#{1, 3, 7}&/@(2^Range[0, 20])]] (* Harvey P. Dale, Jan 30 2014 *)

CROSSREFS

Sequence in context: A018585 A018399 A329855 * A018314 A212216 A199639

Adjacent sequences:  A029745 A029746 A029747 * A029749 A029750 A029751

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Colin Barker, Jul 19 2013

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 09:30 EDT 2020. Contains 336423 sequences. (Running on oeis4.)