Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120636
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120636 a(1) = 1. Replace each prime power in the prime-factorizaton of n with the next lower prime-power. +0
3
1, 1, 2, 3, 4, 2, 5, 7, 8, 4, 9, 6, 11, 5, 8, 13, 16, 8, 17, 12, 10, 9, 19, 14, 23, 11, 25, 15, 27, 8, 29, 31, 18, 16, 20, 24, 32, 17, 22, 28, 37, 10, 41, 27, 32, 19, 43, 26, 47, 23, 32, 33, 49, 25, 36, 35, 34, 27, 53, 24, 59, 29, 40, 61, 44, 18, 64, 48, 38, 20, 67, 56, 71, 32, 46, 51 (list; graph; listen)
OFFSET

1,3

EXAMPLE

50 = 2^1 *5^2. 1 is the prime power closest to 2 and smaller than 2. 23 is the prime power closest to 5^2 and smaller than 5^2. So a(50) = 1*23 = 23.

PROGRAM

(PARI) { a(n) = local(f, r, k, d); f=factorint(n); r=1; for(i=1, matsize(f)[1], k=f[i, 1]^f[i, 2]-1; while(k>1 && !isprime(k) && (!ispower(k, X=X, &d)||!isprime(d)), k--); r*=k); r } - Max Alekseyev (maxal(AT)cs.ucsd.edu), Mar 26 2007

CROSSREFS

Cf. A120635.

Adjacent sequences: A120633 A120634 A120635 this_sequence A120637 A120638 A120639

Sequence in context: A100798 A121701 A026346 this_sequence A117744 A091732 A109746

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 22 2006

EXTENSIONS

More terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), Mar 26 2007

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 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research