|
| |
|
|
A099506
|
|
a(1)=1; for n > 1, a(n)=smallest m>0 that has not appeared so far in the sequence such that m+a(n-1) is a multiple of n.
|
|
5
| |
|
|
1, 3, 6, 2, 8, 4, 10, 14, 13, 7, 15, 9, 17, 11, 19, 29, 5, 31, 26, 34, 50, 16, 30, 18, 32, 20, 61, 23, 35, 25, 37, 27, 39, 63, 42, 66, 45, 69, 48, 72, 51, 33, 53, 79, 56, 36, 58, 38, 60, 40, 62, 94, 12, 96, 124, 44, 70, 46, 131, 49, 73, 113, 76, 52, 78, 54, 80, 192, 84, 126, 87
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| a(1)=1 by definition. a(2)=3 because then a(2)+a(1)=3+1=4 which is a multiple of 2. a(2) cannot =1 (which would lead to a sum of 2) because this has already appeared. Likewise, a(3)=6 so that a(3)+a(2)=6+3=9 which is a multiple of 3,
a(4)=2 so that a(4)+a(3)=2+6=8 and so on.
|
|
|
CROSSREFS
| Cf. A099507 for positions of occurrences of integers in this sequence.
Sequence in context: A098141 A175458 A135598 * A205001 A154204 A002516
Adjacent sequences: A099503 A099504 A099505 * A099507 A099508 A099509
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Mark Hudson (mrmarkhudson(AT)hotmail.com), Oct 20 2004
|
| |
|
|
