id:A134162 - OEIS Search Results

Search: id:A134162

Displaying 1-1 of 1 results found.

page 1

Let S(k) be the sequence s() defined by s(1) = k; for i>1, s(i) = s(i-1) + gcd(s(i-1), i). Start with the list of natural numbers, and remove any k's for which S(k) merges with an S(m) with m < k. This sequence gives conjectural values for the remaining k's.

+0
2

1, 2, 4, 8, 16, 20, 44, 92, 110, 136, 152, 170, 172, 188, 200, 212, 236, 242, 256, 272, 316, 332, 368, 440, 488, 500, 590, 616, 620, 632, 650, 676, 704, 710, 742, 788, 824, 848, 892, 946, 952, 968, 1010, 1034, 1036, 1052, 1058, 1088, 1118 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`In other words, these are conjectural initial values k for which the sequences S(k) never merge. The resulting S(k) have been checked to be distinct for 2^60 terms, but it is possible that they merge later on.`
	CROSSREFS	`Cf. A084662, A084663, A106108 and other sequences mentioned in A106108.` `Sequence in context: A067945 A089473 A118021 this_sequence A045776 A102252 A001856` `Adjacent sequences: A134159 A134160 A134161 this_sequence A134163 A134164 A134165`
	KEYWORD	`nonn`
	AUTHOR	`Eric Rowland (erowland(AT)math.rutgers.edu), Jan 29 2008`

page 1

Search completed in 0.002 seconds

Last modified December 4 21:35 EST 2008. Contains 151309 sequences.

AT&T Labs Research