OFFSET
1,2
COMMENTS
a(n) starts with the digits of 2n-1. Indices of prime or probable prime terms are 1,2,37,62,409,...: see also A089922. - M. F. Hasler, Apr 13 2008
If n == 0 (mod 3), so is a(n). - Sergey Pavlov, Mar 29 2017
REFERENCES
Mihaly Bencze [Beneze] and L. Tutescu, Some Notions and Questions in Number Theory, Sequence 3.
LINKS
Florentin Smarandache, Sequences of Numbers Involved in Unsolved Problems, arXiv:math/0604019 [math.GM], 2006.
MATHEMATICA
Table[FromDigits[Flatten[IntegerDigits/@Join[Reverse[Range[1, n, 2]]]]], {n, 1, 29, 2}] (* Harvey P. Dale, Jun 02 2011 *)
PROG
(PARI) t=""; for( n=1, 10^3, ( t=eval( Str( 2*n-1, t))) & print(n" "t)) \\ M. F. Hasler, Apr 13 2008
(Python)
def a(n): return int("".join(map(str, range(2*n-1, 0, -2))))
print([a(n) for n in range(1, 17)]) # Michael S. Branicky, Jan 31 2021
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
M. I. Petrescu (mipetrescu(AT)yahoo.com)
EXTENSIONS
Edited and extended by M. F. Hasler, Apr 13 2008
Edited by T. D. Noe, Oct 30 2008
STATUS
approved