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!)
A063382 a(1) = 5, 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 #2 Mar 30 2012 17:30:32

%S 5,15,35,57,319,1129,11129,31359,310453,1691837,7241691,15094799,

%T 31486929,159198031,1159198031,6203186877,11721529237,88429132553,

%U 129487682919,1228291054211,1394483927247,8800411584567,34329256355023

%N a(1) = 5, 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, 5, 24 ]

%Y Cf. A003681, A062094 and A062095.

%K base,nonn

%O 1,1

%A _Robert G. Wilson v_, Aug 08 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 24 13:08 EDT 2024. Contains 371945 sequences. (Running on oeis4.)