id:A051135 - OEIS Search Results

Search: id:A051135

Displaying 1-1 of 1 results found.

page 1

a(n) = number of times n appears in the Hofstadter-Conway $10000 sequence A004001.

+0
4

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

	OFFSET	`1,1`
	COMMENT	`If the initial 2 is changed to a 1, the resulting sequence has the property that if all 1's are deleted, the remaining terms are the sequence incremented. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 05 2006`
	MAPLE	`a[1]:=1: a[2]:=1: for n from 3 to 300 do a[n]:=a[a[n-1]]+a[n-a[n-1]] od: A:=[seq(a[n], n=1..300)]:for j from 1 to A[nops(A)-1] do c[j]:=0: for n from 1 to 300 do if A[n]=j then c[j]:=c[j]+1 else fi od: od: seq(c[j], j=1..A[nops(A)-1]); - Emeric Deutsch, Jun 06 2006`
	CROSSREFS	`Cf. A004001.` `Sequence in context: A116687 A056044 A116685 this_sequence A135352 A072528 A117470` `Adjacent sequences: A051132 A051133 A051134 this_sequence A051136 A051137 A051138`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Robert Lozyniak (11(AT)onna.com)`
	EXTENSIONS	`More terms from Jud McCranie (j.mccranie(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research