id:A123679 - OEIS Search Results

Search: id:A123679

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`1,7`
	COMMENT	`For k > 1, apparently the smallest n such that a(n) = k is 2^k + k + 1 (see A005126).`
	PROGRAM	`(PARI) {m=105; w=vector(2m); print1(1, ", "); for(n=2, m, k=n; while(w[k], k--); a=n+k; print1(2n-a, ", "); w[a]=1)}`
	CROSSREFS	`Cf. A123088, A005126.` `Sequence in context: A089615 A089731 A097098 this_sequence A111755 A146164 A147700` `Adjacent sequences: A123676 A123677 A123678 this_sequence A123680 A123681 A123682`
	KEYWORD	`nonn`
	AUTHOR	`Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 05 2006`

page 1

Search completed in 0.002 seconds

Last modified December 3 16:57 EST 2008. Contains 151279 sequences.

AT&T Labs Research