id:A111698 - OEIS Search Results

Search: id:A111698

Displaying 1-1 of 1 results found.

page 1

a(1)=1. Skipping over integers occurring earlier in the sequence, count down a composite from a(n) to get a(n+1) so that a(n+1) is the smallest possible positive integer arrived at this way. If there are no positive integers at a distance of a composite number of yet unused integers, instead count up from a(n) 4 (the lowest composite positive integer) positions (skipping already occurring integers) to get a(n+1).

+0
1

1, 5, 9, 2, 7, 12, 3, 10, 15, 4, 13, 18, 6, 16, 21, 8, 19, 24, 11, 22, 27, 14, 25, 30, 17, 28, 33, 20, 31, 36, 23, 34, 39, 26, 37, 42, 29, 40, 45, 32, 43, 48, 35, 46, 51, 38, 49, 54, 41, 52, 57, 44, 55, 60, 47, 58, 63, 50, 61, 66, 53, 64, 69, 56, 67, 72, 59, 70, 75, 62, 73, 78 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.

AT&T Labs Research