login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063384 a(1) = 7, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1). 0

%I #3 Mar 30 2012 17:30:32

%S 7,17,117,913,1183,1391,13107,51257,151257,381397,577661,4911789,

%T 29116879,112646989,536920981,1928258999,11928258999,25227472837,

%U 46275452231,212892173679,370964057893,1859199550327,5593332415439

%N a(1) = 7, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).

%t f[ n_Integer ] := (d = Divisors[ n ]; l = Length[ d ]; If[ EvenQ[ l ], ToExpression[ ToString[ d[[ l/2 ] ]] <> ToString[ d[[ l/2 + 1 ]] ]], ToExpression[ ToString[ d[[ l/2 + .5 ] ]] <> ToString[ d[[ l/2 + .5 ] ]] ]] ); NestList[ f, 7, 25 ]

%Y Cf. A003681, A062094 and A062095.

%K base,nonn

%O 1,1

%A _Robert G. Wilson v_, Aug 09 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)