Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134579 Column products of tables A133232 and A133233. +0
1
1, 4, 729, 256, 95367431640625, 0, 311973482284542371301330321821976049, 16777216, 150094635296999121, 0, 3574335935197503226412197580625705154978327969466895714094061686977589739390331653361877238387305580817715435470601 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = if A014963(n)*A100994(n)-n >= 0 then n^[A014963(n)*A100994(n)-n] else 0.

EXAMPLE

a(1) = 1^(1*1-1) = 1

a(2) = 2^(2*2-2) = 4

a(3) = 3^(3*3-3) = 729

a(4) = 4^(2*4-4) = 256

a(5) = 5^(5*5-5) = 95367431640625

a(6) = 6^(1*1-6) = 0

MAPLE

A100994 := proc(n) if nops(numtheory[factorset](n)) <> 1 then 1 ; else n ; fi ; end: A014963 := proc(n) if nops(numtheory[factorset](n)) <> 1 then 1 ; else op(1, op(1, ifactors(n)[2])) ; fi ; end: A134579 := proc(n) local e ; e := A014963(n)*A100994(n)-n ; if e >= 0 then n^e ; else 0 ; fi ; end: seq(A134579(n), n=1..13) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008

CROSSREFS

Cf. A133232, A133233, A014963, A100994.

Adjacent sequences: A134576 A134577 A134578 this_sequence A134580 A134581 A134582

Sequence in context: A046348 A114765 A059754 this_sequence A090588 A053986 A128846

KEYWORD

nonn

AUTHOR

Mats Granvik (mgranvik(AT)abo.fi), Jan 23 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research