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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113836 a(n) = Sum[2^(A001651(i-1)-1), {i,1,n}]. 2
1, 3, 11, 27, 91, 219, 731, 1755, 5851, 14043, 46811, 112347, 374491, 898779, 2995931, 7190235, 23967451, 57521883, 191739611, 460175067, 1533916891, 3681400539, 12271335131, 29451204315, 98170681051, 235609634523 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

From Reinhard Zumkeller, Feb 22 2010: (Start)

For n>1: a(n)=A173593(3*n-5): terms of A173593 ending with digits '11' in binary representation;

for n>0: a(n)=A033129(3*n-1); a(n+1)-a(n)=ABS(A094014(n)). (End)

LINKS

Table of n, a(n) for n=1..26.

FORMULA

Empirical g.f.: x*(2*x+1) / ((x-1)*(8*x^2-1)). - Colin Barker, Sep 01 2013

EXAMPLE

a(2) = 2^(A001651(0)-1) + 2^(A001651(1)-1) = 2^0 + 2^1 = 3

MATHEMATICA

a = {}; s = 0; For[n = 1, n < 40, n++, If[Length[Intersection[{Mod[n, 3]}, {1, 2}]] > 0, s = s + 2^(n - 1); AppendTo[a, s]]]; a

CROSSREFS

Cf. A001651.

Sequence in context: A250271 A289842 A077776 * A036571 A003060 A136983

Adjacent sequences:  A113833 A113834 A113835 * A113837 A113838 A113839

KEYWORD

nonn

AUTHOR

Artur Jasinski, Jan 27 2006

EXTENSIONS

Edited by Stefan Steinerberger, Jul 23 2007

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 September 20 06:19 EDT 2019. Contains 327212 sequences. (Running on oeis4.)