Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132794 Numbers n such that sigma(phi(n))-phi(n)-1=phi(sigma(n)-n-1). +0
2
3, 8, 16, 64, 256, 16384 (list; graph; listen)
OFFSET

1,1

COMMENT

Used sigma(n)-n-1, namely the sum of proper divisors minus 1.

MAPLE

with(numtheory); P:=proc(n) local i, j, k; for i from 1 by 1 to n do j:=sigma(phi(i))-phi(i)-1; k:=phi(sigma(i)-i-1); if j=k then print(i); fi; od; end: P(150000);

CROSSREFS

Cf. A000010, A000203, A001229, A018784, A033632, A132793.

Sequence in context: A024623 A027291 A048952 this_sequence A079666 A048230 A073433

Adjacent sequences: A132791 A132792 A132793 this_sequence A132795 A132796 A132797

KEYWORD

hard,more,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Aug 31 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research