id:A097249 - OEIS Search Results

Search: id:A097249

Displaying 1-1 of 1 results found.

page 1

a(n) = number of times we must iterate A097246, starting at n, before the result is squarefree.

+0
2

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

	OFFSET	`1,12`
	COMMENT	`a(n)=Min{k: r(n,k)=r(n,k+1)}, where r(n,k)=A097246(r(n,k-1)), r(n,0)=n;` `a(A005117(n))=0; a(A097250(n))=n and a(m)<n for m<A097250(n).`
	CROSSREFS	`Cf. A097246, A005117, A097250.` `Sequence in context: A104194 A035153 A069847 this_sequence A112313 A087893 A079169` `Adjacent sequences: A097246 A097247 A097248 this_sequence A097250 A097251 A097252`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 03 2004`
	EXTENSIONS	`Edited by Sam Alexander (amnalexander(AT)yahoo.com), Jan 05 2005`

page 1

Search completed in 0.002 seconds

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.

AT&T Labs Research