The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034776 Gozinta numbers: possible number of gozinta chains for some positive integer. 6
 1, 2, 3, 4, 8, 13, 16, 20, 26, 32, 44, 48, 64, 75, 76, 112, 128, 132, 176, 208, 252, 256, 308, 368, 512, 541, 544, 576, 604, 768, 818, 976, 1024, 1076, 1280, 1376, 1460, 1888, 2048, 2208, 2316, 2496, 2568, 2612, 2816, 3172, 3392, 3408, 4096, 4683, 5536, 5740 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A gozinta chain for n is a sequence (1,a,b,...,n) where each element properly divides the next. LINKS D. Wilson, Table of n, a(n) for n = 1..10000 Project Euler, Problem 548: Gozinta Chains. CROSSREFS Range of A002033, also odd elements form A000670. Sequence in context: A098348 A131420 A095705 * A068791 A219968 A126042 Adjacent sequences:  A034773 A034774 A034775 * A034777 A034778 A034779 KEYWORD nonn AUTHOR 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 November 26 04:47 EST 2022. Contains 358353 sequences. (Running on oeis4.)