The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A269059 Construct a hollow square of 1's of side n and fill its interior with 0's to create a stack of n binary numbers. Express the sum of the stack in decimal. 0
 1, 6, 19, 48, 113, 258, 579, 1284, 2821, 6150, 13319, 28680, 61449, 131082, 278539, 589836, 1245197, 2621454, 5505039, 11534352, 24117265, 50331666, 104857619, 218103828, 452984853, 939524118, 1946157079, 4026531864, 8321499161, 17179869210, 35433480219, 73014444060 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..32. Index entries for linear recurrences with constant coefficients, signature (6, -13, 12, -4). FORMULA a(n) = 2*(2^n-1)+(n-2)*(2^(n-1)+1), for n>1. G.f.: x*(1-2*x^2)^2/((1-2*x)^2*(1-x)^2). - Robert Israel, Feb 18 2016 EXAMPLE 1 1 1 3 1 1 1 7 1 1 1 1 15 a(1)=1 1 1 +3 1 0 1 +5 1 0 0 1 + 9 a(2)=6 1 1 1 +7 1 0 0 1 + 9 a(3)=19 1 1 1 1 +15 a(4)=48 MATHEMATICA Join[{1}, LinearRecurrence[{6, -13, 12, -4}, {0, 6, 19, 48}, {2, 32}]] (* Jean-François Alcover, Feb 27 2016 *) PROG (Magma) [1] cat [2*(2^n-1)+(n-2)*(2^(n-1)+1): n in [2..40]]; // Vincenzo Librandi, Feb 27 2016 (PARI) a(n) = if (n==1, 1, 2*(2^n-1)+(n-2)*(2^(n-1)+1)); \\ Michel Marcus, Mar 24 2016 (PARI) Vec(x*(1-2*x^2)^2/((1-2*x)^2*(1-x)^2) + O(x^100)) \\ Altug Alkan, Mar 24 2016 CROSSREFS Sequence in context: A273079 A073362 A095264 * A324218 A229731 A360951 Adjacent sequences: A269056 A269057 A269058 * A269060 A269061 A269062 KEYWORD nonn,base,easy AUTHOR Gil Broussard, Feb 18 2016 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.

Last modified May 21 05:34 EDT 2024. Contains 372728 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://oeis.org/A269059", "fetch_time": 1716284768000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-22/segments/1715971058442.20/warc/CC-MAIN-20240521091208-20240521121208-00823.warc.gz", "warc_record_offset": 375794762, "warc_record_length": 4431, "token_count": 846, "char_count": 2138, "score": 3.59375, "int_score": 4, "crawl": "CC-MAIN-2024-22", "snapshot_type": "latest", "language": "en", "language_score": 0.6103153824806213, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00028-of-00064.parquet"}