id:A068630 - OEIS Search Results

Search: id:A068630

Displaying 1-1 of 1 results found.

page 1

a(1) = 0. a(n) = n + a(n-1) if GCD(n,a(n-1)) = 1 or a(n-1) = 0 a(n) = a(n-1) - n if n divides a(n-1). else a(n) = a(n-1).

+0
1

0, 1, 3, 0, 4, 9, 9, 16, 8, 17, 27, 38, 38, 51, 65, 65, 81, 98, 98, 117, 137, 158, 158, 181, 205, 205, 231, 231, 231, 260, 260, 291, 323, 356, 356, 391, 427, 464, 464, 503, 543, 584, 584, 627, 627, 627, 673, 720, 672, 672, 672, 672, 672, 725, 779, 889, 889, 946 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Cf. A068626, A068627, A068628, A068629.` `Adjacent sequences: A068627 A068628 A068629 this_sequence A068631 A068632 A068633` `Sequence in context: A008344 A088230 A072329 this_sequence A079406 A068627 A074171`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 26 2002`

page 1

Search completed in 0.002 seconds

Last modified October 12 13:44 EDT 2008. Contains 144830 sequences.

AT&T Labs Research