The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A063403 a(1) = 8, 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 8,24,46,223,1223,11223,87129,189461,414621,2072003,12072003,34024001,

%T 163920759,354640253,1074732999,7377145687,17377145687,57053304579,

%U 393145173803,834736688841,8062231035367,26899299722333,27745499695017

%N a(1) = 8, 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, 8, 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 June 6 08:35 EDT 2024. Contains 373119 sequences. (Running on oeis4.)