Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063380
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063380 a(1) = 4, 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
4, 22, 211, 1211, 7173, 9797, 97101, 910789, 1182799, 1319029, 6719687, 7678761, 32559587, 257126691, 1591617149, 6653239233, 62767105999, 126149775659, 432933715713, 2435717774509, 6598336914323, 19495633384521 (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, 4, 24 ]

CROSSREFS

Cf. A003681, A062094 and A062095.

Sequence in context: A002728 A062494 A103437 this_sequence A113385 A120482 A137158

Adjacent sequences: A063377 A063378 A063379 this_sequence A063381 A063382 A063383

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research