Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096432
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096432 Let n = 2^e_2 * 3^e_ * 5^e_ * ... be the prime factorization of n; sequence gives n such that 1 + max{e_2, e_3, ...} is a prime. +0
3
2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83 (list; graph; listen)
OFFSET

1,1

COMMENT

The old entry with this sequence number was a duplicate of A004555.

MAPLE

(Maple code for this entry and A074661)

M:=2000; ans1:=[]; ans2:=[];

for n from 1 to M do

t1:=op(2..-1, ifactors(n)); t2:=nops(t1);

m1:=0; for i from 1 to t2 do m1:=max(m1, t1[i][2]); od:

if isprime(1+m1) then ans1:=[op(ans1), n]; fi;

if isprime(m1) then ans2:=[op(ans2), n]; fi;

od:

CROSSREFS

Cf. A060476, A074661.

Sequence in context: A004727 A102352 A007412 this_sequence A138302 A052421 A037477

Adjacent sequences: A096429 A096430 A096431 this_sequence A096433 A096434 A096435

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 18 2008

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