Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010553 tau(tau(n)). +0
10
1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 4, 2, 3, 3, 2, 2, 4, 2, 4, 3, 3, 2, 4, 2, 3, 3, 4, 2, 4, 2, 4, 3, 3, 3, 3, 2, 3, 3, 4, 2, 4, 2, 4, 4, 3, 2, 4, 2, 4, 3, 4, 2, 4, 3, 4, 3, 3, 2, 6, 2, 3, 4, 2, 3, 4, 2, 4, 3, 4, 2, 6, 2, 3, 4, 4, 3, 4, 2, 4, 2 (list; graph; listen)
OFFSET

1,2

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.

LINKS

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].

MAPLE

with(numtheory): f := n->tau(tau(n));

CROSSREFS

Cf. A000005.

Sequence in context: A128764 A074589 A081309 this_sequence A108502 A078120 A057525

Adjacent sequences: A010550 A010551 A010552 this_sequence A010554 A010555 A010556

KEYWORD

nonn

AUTHOR

njas

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research