|
| |
|
|
A146215
|
|
Addition of lowest nonzero prime division remainders.
|
|
0
| |
|
|
1, 2, 4, 5, 6, 7, 8, 10, 11, 12, 14, 16, 17, 18, 21, 22, 23, 24, 28, 29, 30, 32, 34, 35, 36, 37, 38, 40, 41, 42, 44, 46, 47, 48, 51, 52, 65, 66, 67, 68, 70
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| The sequence is linear on a large scale. For 10^9 terms, a(n)/n is calculated to be 1.5859351, giving an approximate natural density of 0.6305428.
|
|
|
FORMULA
| a(1) = 1 a(n+1) = a(n) + mod(a(n), P), where P is the lowest prime such that mod(a(n), P) is nonzero.
|
|
|
PROG
| (Other) % Matlab function. % prime is expected to be an array containing all required primes. a = zeros(1, terms); a(1) = 1; for n = 1:terms-1 j = 1; right = 0; while (right == 0) if (mod(a(n), prime(j)) == 0) j = j + 1; else right = 1; end end a(n+1) = a(n) + mod(a(n), prime(j)); end
|
|
|
CROSSREFS
| Sequence in context: A039140 A085302 A193928 * A086743 A039079 A188160
Adjacent sequences: A146212 A146213 A146214 * A146216 A146217 A146218
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Sigurd Wenner (sigurd.wenner(AT)ils.uio.no), Oct 28 2008
|
| |
|
|
