id:A096823 - OEIS Search Results

Search: id:A096823

Displaying 1-1 of 1 results found.

page 1

Numbers of the form p*(p+(2n-1))/2 created with smallest primes of form p=2^x-(2n-1)=A096522(n). Here the exponent equals x=A096502[n], the least exponent providing this kind of primes. Peculiarity of the present terms is as follows: Mod[sigma[a(n)],a[n]]=2*n.

+0
1

6, 20, 12, 151115727449904501489664, 56, 40, 24, 272, 1504, 208, 176, 1312, 112, 80, 48, 6208, 992, 928, 2059264, 5696, 736, 144115176533131264, 608, 544, 5056, 416, 352, 4672, 224, 160, 96, 24704, 24448, 3904, 3776, 487936, 112384, 3392, 22912 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`These numbers are clearly analogous to perfect numbers.`
	EXAMPLE	`a[1]=6 is the first even perfect number;` `a[7]=24 corresponds to A096821(1)=24;` `a[4]=151115727449904501489664=2^38(2^39-7)=274877906944549755813881;`
	CROSSREFS	`Cf. A096502, A096821, A096822.` `Sequence in context: A090590 A002566 A087998 this_sequence A007253 A096897 A063601` `Adjacent sequences: A096820 A096821 A096822 this_sequence A096824 A096825 A096826`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 13 2004`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research