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.

Previous Showing 11-12 of 12 results.

A197432 a(n) = Sum_{k>=0} A030308(n,k)*C(k) where C(k) is the k-th Catalan number (A000108).

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 8, 9, 14, 15, 15, 16, 16, 17, 17, 18, 19, 20, 20, 21, 21, 22, 22, 23, 42, 43, 43, 44, 44, 45, 45, 46, 47, 48, 48, 49, 49, 50, 50, 51, 56, 57, 57, 58, 58, 59, 59, 60, 61, 62, 62, 63, 63, 64, 64, 65
Offset: 0

Views

Author

Philippe Deléham, Oct 15 2011

Keywords

Comments

Replace 2^k with A000108(k) in binary expansion of n.

Examples

			11 = 1011_2, so a(11) = 1*1 + 1*1 + 0*2 + 1*5 = 7.
		

Crossrefs

Other sequences that are built by replacing 2^k in binary representation with other numbers: A022290 (Fibonacci), A029931 (natural numbers), A059590 (factorials), A089625 (primes), A197354 (odd numbers).

Formula

G.f.: (1/(1 - x))*Sum_{k>=0} Catalan number(k)*x^(2^k)/(1 + x^(2^k)). - Ilya Gutkovskiy, Jul 23 2017

A326032 a(2^x + ... + 2^z) = w(x) + ... + w(z), where x...z are distinct nonnegative integers and w = A000120.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 3, 3, 4, 4, 4, 4, 5
Offset: 0

Views

Author

Gus Wiseman, Jul 22 2019

Keywords

Comments

From Robert Israel, Jul 23 2019: (Start)
a(2*n+1)=a(2*n).
a(n)=1 if and only if n > 1 is in A283526. (End)

Examples

			For example, a(6) = a(2^2 + 2^1) = w(2) + w(1) = 2.
		

Crossrefs

Other sequences that are built by replacing 2^k in the binary representation with other numbers: A022290 (Fibonacci), A059590 (factorials), A073642, A089625 (primes), A116549, A326031.

Programs

  • Maple
    Bwt:= proc(n) option remember; convert(convert(n,base,2),`+`) end proc:
    f:= proc(n) local L,i;
      L:= convert(n,base,2);
      add(L[i]*Bwt(i-1),i=1..nops(L))
    end proc:
    map(f, [$0..100]); # Robert Israel, Jul 23 2019
  • Mathematica
    bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    Table[Total[Length/@bpe/@(bpe[n]-1)],{n,0,100}]
Previous Showing 11-12 of 12 results.