Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058888
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058888 Number of terms in the set invphi(2*p(n)), where p(n) is the n-th prime. +0
7
4, 4, 2, 0, 2, 0, 0, 0, 2, 2, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

0,1

EXAMPLE

The set invphi(2*3)={7,9,14,18}. It has 4 terms, so a(2)=4, while invphi(2*1601)={3203,6406}, thus a(252)=2.

MAPLE

with(numtheory): [seq(nops(invphi(2*ithprime(i))), i=1..256)];

CROSSREFS

A000010, A005277, A007617, A002202.

Sequence in context: A111845 A120396 A141024 this_sequence A153015 A153163 A120438

Adjacent sequences: A058885 A058886 A058887 this_sequence A058889 A058890 A058891

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 08 2001

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