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.

A066957 a(n) = number of ways of placing '+' and '-' among the digits 123456789 so that the result of the expression is n, '-' before 1 IS allowed.

Original entry on oeis.org

22, 43, 18, 41, 18, 40, 24, 39, 18, 46, 17, 38, 27, 38, 24, 43, 18, 39, 23, 37, 23, 43, 25, 36, 32, 36, 25, 44, 25, 35, 34, 31, 26, 37, 24, 35, 32, 32, 27, 37, 31, 26, 34, 34, 29, 42, 27, 27, 35, 26, 28, 35, 29, 33, 30, 26, 23, 29, 32, 25, 33, 30, 24, 34, 22, 26, 32, 30, 25
Offset: 0

Views

Author

Miklos SZABO (mike(AT)ludens.elte.hu), Feb 01 2002

Keywords

Comments

A066957(9)=46 is the largest term; A066957(456789)=2 is the last term greater than 1; a(n)=0 for n>123456789; 1715 terms are greater than 0; a(A136601(n))=0; a(A136602(n))>0; a(A136603(n))=1; partial sums are A136604. - Reinhard Zumkeller, Jan 12 2008

Crossrefs

Cf. A066956.