Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072073
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072073 Number of solutions to Cototient(x)=A051953[x]= 2^n. +0
1
1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10 (list; graph; listen)
OFFSET

1,2

EXAMPLE

InvCototient[2^0] has infinite number of entries, so 2^0=1 is left out. n=14: 2^14=16384, InvCototient[16384]= {24576,28672,31744,32512,32764,32768}, so a(14)=6; a(n) increases at A000043(n).

CROSSREFS

Cf. A051953, A058764, A000043, A063740.

Adjacent sequences: A072070 A072071 A072072 this_sequence A072074 A072075 A072076

Sequence in context: A073933 A056792 A130500 this_sequence A061716 A126236 A073047

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 13 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 12 13:44 EDT 2008. Contains 144830 sequences.


AT&T Labs Research