Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113854 a(n) = Sum[2^(A047240(i)-1), {i,1,n}]. +0
2
1, 3, 35, 99, 227, 2275, 6371, 14563, 145635, 407779, 932067, 9320675, 26097891, 59652323, 596523235, 1670265059, 3817748707, 38177487075, 106896963811, 244335917283, 2443359172835, 6841405683939, 15637498706147 (list; graph; listen)
OFFSET

1,2

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

Cf. A047240.

Sequence in context: A102104 A054287 A001539 this_sequence A076376 A133710 A130061

Adjacent sequences: A113851 A113852 A113853 this_sequence A113855 A113856 A113857

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 24 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research