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.

A233394 Sum of c-divisors of n.

Original entry on oeis.org

1, 2, 4, 4, 8, 9, 11, 8, 14, 12, 22, 17, 27, 26, 26, 16, 26, 24, 36, 26, 39, 36, 52, 33, 51, 45, 68, 48, 73, 63, 57, 32, 50, 44, 64, 40, 67, 60, 82, 50, 77, 54, 96, 68, 94, 88, 114, 65, 99, 87, 124, 85, 124, 103, 153, 92, 139, 120, 170, 115, 171, 140, 120, 64
Offset: 1

Views

Author

Vladimir Shevelev, Dec 08 2013

Keywords

Examples

			Let n=23. By the definition of c-divisor (see comment in A124771), 23 has the following c-divisors: 0, 1, 2, 3, 5, 7, 11, 23. So a(23)=52.
		

Crossrefs

Programs

  • Mathematica
    bitPatt[n_]:=bitPatt[n]=Split[IntegerDigits[n,2],#1>#2||#2==0&];cDivisors[0]:={0};cDivisors[n_]:=Insert[Insert[Map[#[[1]]&,Select[Table[{z,Cases[{bitPatt[n]},Apply[{_,##,_}&,bitPatt[z]]]},{z,n/2}],#[[2]]=!={}&]],0,1],n,-1];Map[Apply[Plus,cDivisors[#]]&,Range[50]] (* Peter J. C. Moses, Dec 08 2013 *)

Extensions

More terms from Peter J. C. Moses, Dec 08 2013