Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127669
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127669 Number of numbers mapped to A127668(n) with the map described there. +0
2
1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 5, 1, 3, 1, 3, 2, 2, 1, 5, 2, 2, 3, 3, 1, 3, 1, 7, 2, 2, 2, 5, 1, 2, 2, 5, 1, 3, 1, 3, 3, 2, 1, 7, 2, 3, 2, 3, 1, 5, 2, 5, 2, 2, 1, 5, 1, 2, 3, 11, 2, 3, 1, 3, 2, 3, 1, 7, 1, 2, 3, 3, 2, 3, 1, 7, 5, 2, 1, 5, 2, 2, 2, 5, 1, 5, 2, 3, 2, 2, 2, 11, 1, 3, 3, 5 (list; graph; listen)
OFFSET

2,3

COMMENT

This is not A008481(n), n>=2, which starts similarly, but differs, beginning with n=24.

FORMULA

a(n)=pa(Length( A127668(n))), n>=2. Length gives the number of digits and pa(k):=A000041(k) (partition numbers).

EXAMPLE

a(4)=2 because two numbers are mapped to 11= A127668(4), namely n=p(1)*p(1)=4 and n=p(11)=31. p(n)=A000041(n) (partition numbers).

CROSSREFS

Cf. a(24)=5 but A008481(24)=4.

The five numbers mapped to A127668(24)= 2111 are: 18433, 2594, 2263, 292, 24.

Sequence in context: A098893 A069248 A008481 this_sequence A056692 A039637 A069157

Adjacent sequences: A127666 A127667 A127668 this_sequence A127670 A127671 A127672

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Jan 23 2007

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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research