|
Search: id:A076994
|
|
|
| A076994 |
|
a(1) = 2, a(n+1) is the largest square-free number < 2a(n). |
|
+0
2
|
|
| 2, 3, 5, 7, 13, 23, 43, 85, 167, 331, 661, 1321, 2641, 5281, 10561, 21121, 42241, 84481, 168961, 337921, 675841, 1351681, 2703361, 5406721, 10813441, 21626881, 43253761, 86507521, 173015041, 346030081, 692060161, 1384120321, 2768240641
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Analogous to Bertrand's primes.
|
|
MAPLE
|
with(numtheory):a[1] := 2:for n from 2 to 84 do q := 2*a[n-1]-1:while(not issqrfree(q)) do q := q-1:od:a[n] := q:od:seq(a[l], l=1..84);
|
|
CROSSREFS
|
Cf. A006992.
Sequence in context: A132394 A006992 A080190 this_sequence A124147 A135372 A103597
Adjacent sequences: A076991 A076992 A076993 this_sequence A076995 A076996 A076997
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 26 2002
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 26 2003
|
|
|
Search completed in 0.002 seconds
|
