id:A081315 - OEIS Search Results

Search: id:A081315

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 2, 3, 2, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 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	`0,2`
	COMMENT	`a(n) appears a(n)-1 times in sequence.`
	EXAMPLE	`a(2)=3 because 2 appears a total of 3 times in the two sequences: once in A001477, once as a(1) in this sequence, and once as a(3). The number 2 cannot be chosen as a(2) because that would mark the third appearance of 2, creating a contradiction; neither a(2)=3 nor the consequent a(3)=2 creates any contradiction, however.`
	CROSSREFS	`Sequence for positive integers is A081316, see also A001462.` `Sequence in context: A035583 A105079 A087437 this_sequence A035662 A029143 A072406` `Adjacent sequences: A081312 A081313 A081314 this_sequence A081316 A081317 A081318`
	KEYWORD	`easy,nonn`
	AUTHOR	`Matthew Vandermast (ghodges14(AT)comcast.net), Mar 17 2003`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research