|
Search: id:A096098
|
|
|
| A096098 |
|
a(1) = 2, a(2) = 1; for n >= 3, a(n) = least number not included earlier that divides the concatenation of all previous terms. |
|
+0
2
|
|
| 2, 1, 3, 71, 7, 21, 599, 173, 11, 23, 161, 49, 13, 9, 131, 19, 33, 17, 1489, 331, 3989, 69, 3097350956401900335673788279883089441874368101, 349387, 5651, 443, 29, 51
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture:(1) Every concatenation is squarefree. (2) This is a rearrangement of the squarefree numbers not divisible by 5.
The concatenations are not always square-free, since a(12)=49 and a(14)=9. There are no more even numbers in the sequence since odd a(n) => odd concatenation => odd a(n+1). Conjecture:(3) the sequence for n>=2 is a permutation of the positive integers not divisible by 2 or 5. a(29) is probably 479470832244949, in which case the sequence continues 479470832244949, 661, 1129, 1873, 181. - Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 21 2007
|
|
EXAMPLE
|
a(6) = 21 as 213717 = 3*7*10177.
|
|
CROSSREFS
|
Cf. A096097.
Sequence in context: A059333 A106485 A126008 this_sequence A096097 A016585 A143316
Adjacent sequences: A096095 A096096 A096097 this_sequence A096099 A096100 A096101
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 24 2004
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 03 2007
a(23)-a(26) from N. J. A. Sloane (njas(AT)research.att.com), Nov 10 2007
Corrected and extended by Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 21 2007
|
|
|
Search completed in 0.002 seconds
|
