|
Search: id:A036441
|
|
|
| A036441 |
|
a(n+1) = next number having largest prime dividing a(n) as a factor, with a(1) = 2. |
|
+0
3
|
|
| 2, 4, 6, 9, 12, 15, 20, 25, 30, 35, 42, 49, 56, 63, 70, 77, 88, 99, 110, 121, 132, 143, 156, 169, 182, 195, 208, 221, 238, 255, 272, 289, 306, 323, 342, 361, 380, 399, 418, 437, 460, 483, 506, 529, 552, 575, 598, 621, 644, 667, 696, 725, 754, 783, 812, 841, 870
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(2,n) satisfies the following inequality: 1/4*(n^2+3*n+1)<=a(n)<=1/4*(n-2)^2. Also a(a(r,k), n)=a(r,n+k-1), for all n,k in N\{0} and all r in N\{0,1}; a(prime(k), n)=a(prime(i), n+prime(k)-prime(i)), for all k,i,n e N\{0}, with k >= i, n >= prime(k-1) and with prime(x) := x-th prime.
Essentially the same as A076271.
|
|
FORMULA
|
a(m, n) := a(m, n-1) + lp(a(m, n-1)), a(m, 1) := m; with lp(x) := "largest prime factor of x"
|
|
EXAMPLE
|
a(2,2)=4 because 2+ lp(2)= 2+2=4; a(2,3)=6 because 4 + lp(4)= 4+2=6
|
|
CROSSREFS
|
Cf. A006530.
Sequence in context: A075349 A130025 A076271 this_sequence A134678 A135146 A053096
Adjacent sequences: A036438 A036439 A036440 this_sequence A036442 A036443 A036444
|
|
KEYWORD
|
eigen,nice,nonn
|
|
AUTHOR
|
Frederick Magata (fmagata(AT)smail.uni-koeln.de)
|
|
EXTENSIONS
|
Better description from Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 04, 2002
|
|
|
Search completed in 0.002 seconds
|
