id:A132157 - OEIS Search Results

Search: id:A132157

Displaying 1-1 of 1 results found.

page 1

a(n) = number of times n occurs in A063882.

+0
2

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

	OFFSET	`1,1`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n = 1..200 [Taken from the Balamohan et al. reference]` `B. Balamohan, A. Kuznetsov and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Intger Sequences, Vol. 10 (2007), #07.7.1.` `Index entries for Hofstadter-type sequences`
	CROSSREFS	`Sequence in context: A079982 A039927 A073802 this_sequence A103163 A010327 A134835` `Adjacent sequences: A132154 A132155 A132156 this_sequence A132158 A132159 A132160`
	KEYWORD	`nonn`
	AUTHOR	`njas, Nov 06 2007`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research