cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A299119 Positive solution to 2^(n-1) = (1/n) * Sum_{d|n} a(d) * a(n/d).

Original entry on oeis.org

1, 2, 6, 14, 40, 84, 224, 484, 1134, 2480, 5632, 12036, 26624, 56896, 122640, 261078, 557056, 1176876, 2490368, 5237360, 11008704, 23057408, 48234496, 100635144, 209714400, 436154368, 905962860, 1878931264, 3892314112, 8052800160, 16642998272, 34359209436
Offset: 1

Views

Author

Gus Wiseman, Feb 03 2018

Keywords

Comments

For prime p, a(p) = 2^(p-2)*p. - Jon E. Schoenfield, Feb 03 2018

Crossrefs

Programs

  • Maple
    with(numtheory):
    a:= proc(n) option remember; `if`(n=1, 1, n*2^(n-2)-
           add(a(d)*a(n/d), d=divisors(n) minus {1, n})/2)
        end:
    seq(a(n), n=1..35);  # Alois P. Heinz, Mar 07 2018
  • Mathematica
    nn=50;
    sys=Table[2^(n-1)*n==Sum[a[d]*a[n/d],{d,Divisors[n]}],{n,nn}];
    Array[a,nn]/.Solve[sys,Array[a,nn]][[2]]