Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

COMMENT

Reference does not include the floor function.

REFERENCES

D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc. Boston MA, 1976, Prob. 7-4 3, p. 152.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,2000

PROGRAM

(PARI) a(n)=floor(n/eulerphi(n)); vector(250, n, a(n))

(PARI) { default(realprecision, 50); for (n=1, 2000, write("b062356.txt", n, " ", floor(n/eulerphi(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 05 2009]

CROSSREFS

Sequence in context: A074093 A048220 A078380 this_sequence A055881 A055874 A161506

Adjacent sequences: A062353 A062354 A062355 this_sequence A062357 A062358 A062359

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 07 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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research