Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
3, 13, 113, 1113, 2153, 12153, 34051, 172003, 1311313, 3473779, 5365543, 16913173, 34014973, 229148537, 479347809, 1807726517, 11807726517, 20529575173, 69833293981, 179443389167, 230839777353, 376946592451 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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 ]

CROSSREFS

Cf. A003681, A062094 and A062095.

Sequence in context: A061377 A006860 A090537 this_sequence A098406 A105431 A062447

Adjacent sequences: A063266 A063267 A063268 this_sequence A063270 A063271 A063272

KEYWORD

base,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 08 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research