Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102442
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102442 Number of iterations needed to transform n by A102440 into a 3-smooth number. +0
5
0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 2, 0, 2, 1, 1, 0, 2, 0, 2, 1, 1, 2, 3, 0, 1, 2, 0, 1, 3, 1, 3, 0, 2, 2, 1, 0, 2, 2, 2, 1, 3, 1, 3, 2, 1, 3, 4, 0, 1, 1, 2, 2, 3, 0, 2, 1, 2, 3, 4, 1, 4, 3, 1, 0, 2, 2, 3, 2, 3, 1, 4, 0, 4, 2, 1, 2, 2, 2, 3, 1, 0, 3, 4, 1, 2, 3, 3, 2, 4, 1, 2, 3, 3, 4, 2, 0, 3, 1, 2, 1, 3, 2, 3, 2, 1 (list; graph; listen)
OFFSET

1,11

COMMENT

a(n) = 0 iff n is 3-smooth (A003586);

a(A102444(n))=n and a(m)<n for m<a(A102444(n)).

EXAMPLE

A102440(A102440(A102440(41)))=24 and A102440(24)=24:

41 -> 3*13 -> 3*[13->2*5]=2*3*5 -> 2*3*[5->2*2]=3*2^3=24,

therefore a(41)=3, A102443(41)=24.

CROSSREFS

Sequence in context: A060950 A039976 A133701 this_sequence A091182 A001822 A112553

Adjacent sequences: A102439 A102440 A102441 this_sequence A102443 A102444 A102445

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 09 2005

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research