Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113828 a(n) = Sum[2^(A047260(i)-1), {i,1,n}]. +0
3
1, 9, 25, 57, 121, 633, 1657, 3705, 7801, 40569, 106105, 237177, 499321, 2596473, 6790777, 15179385, 31956601, 166174329, 434609785, 971480697, 2045222521, 10635157113, 27815026297, 62174764665, 130894241401, 680650055289 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(2) = 2^(A047260(1)-1) + 2^(A047260(2)-1) = 2^0 + 2^3 = 9

MATHEMATICA

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

CROSSREFS

Cf. A047260.

Sequence in context: A112629 A031162 A048490 this_sequence A099971 A124702 A113829

Adjacent sequences: A113825 A113826 A113827 this_sequence A113829 A113830 A113831

KEYWORD

nonn,less

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