login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: (9+16*x+32*x^2+128*x^3+256*x^4+4096*x^5-4096*x^6)/(1-x-4096*x^6+4096*x^7). - Charles R Greathouse IV, Apr 05 2012
MATHEMATICA
LinearRecurrence[{1, 0, 0, 0, 0, 4096, -4096}, {1, 9, 25, 57, 185, 441, 4537}, 30] (* Harvey P. Dale, Aug 04 2018 *)
PROG
(PARI) Vec((-4096*x^6+4096*x^5+256*x^4+128*x^3+32*x^2+16*x+9)/(4096*x^7 - 4096*x^6-x+1)+O(x^99)) \\ Charles R Greathouse IV, Apr 05 2012
CROSSREFS
Sequence in context: A113828 A099971 A124702 * A147338 A147325 A147368
KEYWORD
nonn,easy
AUTHOR
Artur Jasinski, Jan 27 2006
EXTENSIONS
Better definition, corrected offset and edited by Omar E. Pol, Jan 08 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)