Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071835
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071835 Largest prime factor of n = floor(sqrt(n)). +0
2
4, 8, 9, 12, 25, 30, 49, 56, 63, 121, 132, 169, 182, 195, 289, 306, 361, 380, 399, 529, 552, 575, 841, 870, 961, 992, 1023, 1369, 1406, 1443, 1681, 1722, 1849, 1892, 1935, 2209, 2256, 2303, 2809, 2862, 2915, 3481, 3540, 3721, 3782, 3843, 4489, 4556, 4623 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) for(n=2, 10000, if(component(component(factor(n), 1), omega(n))==floor(sqrt(n)), print1(n, ", ")))

CROSSREFS

Sequence in context: A074661 A082293 A048944 this_sequence A010429 A140282 A161757

Adjacent sequences: A071832 A071833 A071834 this_sequence A071836 A071837 A071838

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 08 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research