Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071394
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071394 Numbers n divisible by pi(n) [A057809] with prime pi(n); i.e. largest prime factor of n equals pi(n). +0
2
4, 6, 33, 335, 355, 3073, 8408, 64690, 481044, 1304693, 1304719, 3524318, 3524654, 9559785, 9559905, 70115803, 189963234, 189963918, 514278263, 1394194660, 3779856591, 10246935974, 75370122456, 204475052725, 204475053325 (list; graph; listen)
OFFSET

1,1

EXAMPLE

pi(8408) = 1051, and 8408 = 2.2.2.'1051'.

MATHEMATICA

c = 0; lpf[n_] := If[ PrimeQ[n], c++; n, Transpose[ FactorInteger[n]][[1, -1]]]; Do[ If[ lpf[n] == c, Print[n]], {n, 2, 10^7}]

CROSSREFS

Cf. A000720, A006530.

Sequence in context: A068402 A078250 A087299 this_sequence A137021 A092187 A092765

Adjacent sequences: A071391 A071392 A071393 this_sequence A071395 A071396 A071397

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 12 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 13 2002

More terms from Hans Havermann (pxp(AT)rogers.com), Jul 02 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research