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!)
A063269 a(1) = 3, 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 3,13,113,1113,2153,12153,34051,172003,1311313,3473779,5365543,

%T 16913173,34014973,229148537,479347809,1807726517,11807726517,

%U 20529575173,69833293981,179443389167,230839777353,376946592451

%N a(1) = 3, 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, 3, 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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)