id:A061285 - OEIS Search Results

Search: id:A061285

Displaying 1-1 of 1 results found.

page 1

a(n)=2^[(p(n)-1)/2]. Square root of 2^[p(n)-1], i.e. the smallest number which has p(n) divisors, where p(n) is an odd prime.

+0
2

2, 4, 8, 32, 64, 256, 512, 2048, 16384, 32768, 262144, 1048576, 2097152, 8388608, 67108864, 536870912, 1073741824, 8589934592, 34359738368, 68719476736, 549755813888, 2199023255552, 17592186044416, 281474976710656 (list; graph; listen)

	OFFSET	`2,1`
	FORMULA	`a(n)=Sqrt[Min{x; A000005[x]=p(n)]=Sqrt[A034785(n)/2]=Sqrt[2^(p(n)-1)]=Sqrt[2^A006093(n)]=Sqrt[2^Phi(p(n))]=Sqrt[2^A000010[A000040(n)]].`
	CROSSREFS	`Cf. A034785, A000005, A000010, A000040, A000290, A005179, A006093, A006005.` `Sequence in context: A100083 A053147 A128055 this_sequence A102000 A074406 A064378` `Adjacent sequences: A061282 A061283 A061284 this_sequence A061286 A061287 A061288`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), May 22 2001`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research