Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061340
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061340 n*omega(n)^n where omega(n) is the number of unrepeated prime divisors of n. +0
2
0, 2, 3, 4, 5, 384, 7, 8, 9, 10240, 11, 49152, 13, 229376, 491520, 16, 17, 4718592, 19, 2097152, 0, 44040192, 92274688, 23, 402653184, 25, 1744830464, 27, 7516192768, 29, 617673396283, 9470, 31, 32, 283467841536, 584115552256, 1202590842880 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=n*omega(n)^n.

EXAMPLE

a(6)=6*(2^6)= 384 because omega(6)=2.

PROGRAM

(PARI) for(n=1, 20, print(n*omega(n)^n))

CROSSREFS

Cf. A061452.

Sequence in context: A062942 A032546 A037437 this_sequence A004889 A037435 A001096

Adjacent sequences: A061337 A061338 A061339 this_sequence A061341 A061342 A061343

KEYWORD

easy,nice,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 15 2001

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