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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113829 a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence of numbers that are congruent to {0,3,4,5,7,8} mod 12. 2
1, 9, 25, 57, 185, 441, 4537, 37305, 102841, 233913, 758201, 1806777, 18583993, 152801721, 421237177, 958108089, 3105591737, 7400559033, 76120035769, 625875849657, 1725387477433, 3924410732985, 12720503755193, 30312689799609 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Cf. A099974, A112627, A080355, A080567, A099969, A099970, A099971.

Sequence in context: A113828 A099971 A124702 * A147338 A147325 A147368

Adjacent sequences:  A113826 A113827 A113828 * A113830 A113831 A113832

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Better definition, corrected offset and edited by Omar E. Pol (info(AT)polprimos.com), Jan 08 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:43 EST 2012. Contains 205804 sequences.