id:A123721 - OEIS Search Results

Search: id:A123721

Displaying 1-1 of 1 results found.

page 1

a(n) = A123249(n) - 2*n.

+0
2

1, 0, 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 0, 0, 0, 4, 3, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 0, 0, 0, 4, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 5, 4, 3, 2, 1, 0, 1, 0, 0, 0, 3, 2, 1, 0, 0, 2 (list; graph; listen)

	OFFSET	`1,9`
	COMMENT	`Conjecture: For k > 1, the smallest n such that a(n) = k is A123720(k) = 2^k + 2^(k-1) - k. Confirmed for k <= 22.`
	PROGRAM	`(PARI) {m=105; w=vector(3m); print1(a=1, ", "); for(n=2, m, k=n; while(w[k], k++); a=n+k; print1(a-2n, ", "); w[a]=1)}`
	CROSSREFS	`Cf. A123249, A123720.` `Sequence in context: A072575 A025872 A112344 this_sequence A085863 A054008 A125676` `Adjacent sequences: A123718 A123719 A123720 this_sequence A123722 A123723 A123724`
	KEYWORD	`nonn`
	AUTHOR	`Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 09 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research