Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051265 Maximal value of prime divisors of numbers in reduced residue system for n. +0
4
0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2 (list; graph; listen)
OFFSET

1,7

COMMENT

The smallest number for which a(n)=k is the n-th Euclid number (A006862=A002110 + 1).

EXAMPLE

For n=60 a(n)=1 since in RRS[ 60 ] only 1 and prime powers occur (see A051250).

CROSSREFS

Cf. A051250, A002110, A051266-A051268.

Adjacent sequences: A051262 A051263 A051264 this_sequence A051266 A051267 A051268

Sequence in context: A007875 A050320 A121382 this_sequence A008647 A036475 A076820

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

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 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research