id:A064672 - OEIS Search Results

Search: id:A064672

Displaying 1-1 of 1 results found.

page 1

a(0) = 1, a(1) = 1; for a(n), n >=2, write n = x^2+y with y>=0 as small as possible, then a(n) = a(x) + a(y).

+0
2

0, 1, 2, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 5, 6, 7, 2, 3, 4, 5, 4, 5, 6, 7, 6, 3, 4, 5, 6, 5, 6, 7, 8, 7, 6, 7, 4, 5, 6, 7, 6, 7, 8, 9, 8, 7, 8, 9, 10, 5, 6, 7, 8, 7, 8, 9, 10, 9, 8, 9, 10, 11, 10, 11, 4, 5, 6, 7, 6, 7, 8, 9, 8, 7, 8, 9, 10, 9, 1, 0, 11, 6, 3, 4, 5, 6, 5, 6, 7, 8, 7, 6, 7, 8, 9, 8, 9, 10, 5, 6 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Because of the definition of a(n), a(n^2) = a(n) and more generally a(n^(2m))=a(n), so the sequence recursively contains itself.`
	EXAMPLE	`a(7) = 5 because 7 = 2^2 + 3, a(2) = 2 and a(3) = 3, giving 5`
	CROSSREFS	`Cf. A064689.` `Sequence in context: A110157 A125929 A071933 this_sequence A138554 A063772 A064289` `Adjacent sequences: A064669 A064670 A064671 this_sequence A064673 A064674 A064675`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 09 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research