id:A066957 - OEIS Search Results

Search: id:A066957

Displaying 1-1 of 1 results found.

page 1

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.

+0
6

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 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`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 (reinhard.zumkeller(AT)gmail.com), Jan 12 2008`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000` `R. Zumkeller, Illustration of initial terms`
	CROSSREFS	`Cf. A066956.` `Sequence in context: A026061 A138040 A063327 this_sequence A118602 A086679 A019508` `Adjacent sequences: A066954 A066955 A066956 this_sequence A066958 A066959 A066960`
	KEYWORD	`nice,nonn`
	AUTHOR	`Miklos SZABO (mike(AT)ludens.elte.hu), Feb 01 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research