Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068579 Let phi_m(x)=phi(phi(....(phi(x))...) m times; sequence gives values of n such that phi_3(n)=tau(n). +0
1
1, 11, 13, 19, 33, 34, 35, 39, 46, 57, 58, 62, 74, 86, 88, 102, 104, 105, 110, 130, 135, 138, 152, 154, 174, 182, 186, 190, 222, 258, 264, 280, 312, 330, 342, 390, 456, 462, 546, 570, 594, 756, 840, 1080 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A068576 A068577 A068578 this_sequence A068580 A068581 A068582

Sequence in context: A092402 A081983 A081984 this_sequence A048519 A089774 A002367

KEYWORD

easy,fini,full,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 26 2002

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research