Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113836
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113836 a(n) = Sum[2^(A001651(i-1)-1), {i,1,n}]. +0
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; listen)
OFFSET

1,2

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: A033960 A059400 A077776 this_sequence A036571 A003060 A136983

Adjacent sequences: A113833 A113834 A113835 this_sequence A113837 A113838 A113839

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Jan 27 2006

EXTENSIONS

Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 23 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research