id:A081316 - OEIS Search Results

Search: id:A081316

Displaying 1-1 of 1 results found.

page 1

a(n) is taken as smallest integer such that n appears a total of a(n) times in A081316 (this sequence) and A000027 (the sequence of positive integers).

+0
2

2, 3, 2, 1, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n) appears a(n)-1 times in sequence.`
	EXAMPLE	`a(1)=2 because a(1)=1 would create a contradiction (1 would have appeared twice in the two sequences, not once). a(1)=2 implies that 1 appears once in this sequence; the first term that can equal 1 without creating a contradiction is a(4).`
	CROSSREFS	`Cf. A081315 is equivalent sequence for nonnegative integers, see also A001462.` `Sequence in context: A076549 A104411 A055101 this_sequence A079893 A113908 A065369` `Adjacent sequences: A081313 A081314 A081315 this_sequence A081317 A081318 A081319`
	KEYWORD	`easy,nonn`
	AUTHOR	`Matthew Vandermast (ghodges14(AT)comcast.net), Mar 18 2003`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research