id:A108077 - OEIS Search Results

Search: id:A108077

Displaying 1-1 of 1 results found.

page 1

Largest prime p such that p-1|n.

+0
2

2, 3, 2, 5, 2, 7, 2, 5, 2, 11, 2, 13, 2, 3, 2, 17, 2, 19, 2, 11, 2, 23, 2, 13, 2, 3, 2, 29, 2, 31, 2, 17, 2, 3, 2, 37, 2, 3, 2, 41, 2, 43, 2, 23, 2, 47, 2, 17, 2, 11, 2, 53, 2, 19, 2, 29, 2, 59, 2, 61, 2, 3, 2, 17, 2, 67, 2, 5, 2, 71, 2, 73, 2, 3, 2, 5, 2, 79, 2, 41, 2, 83, 2, 43 (list; graph; listen)

	OFFSET	`1,1`
	MAPLE	`with(numtheory): for n from 1 to 110 do div:=divisors(n): A:=[seq(div[j]+1, j=1..tau(n))]: B:={}: for i from 1 to tau(n) do if isprime(A[i])=true then B:=B union {A[i]} else B:=B: fi: od: C:=convert(B, list): a[n]:=C[nops(C)] od: seq(a[n], n=1..110); (Deutsch)`
	CROSSREFS	`Largest term in row n of A108939.` `Sequence in context: A086765 A079868 A088444 this_sequence A141310 A007389 A007388` `Adjacent sequences: A108074 A108075 A108076 this_sequence A108078 A108079 A108080`
	KEYWORD	`nonn,easy`
	AUTHOR	`Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 20 2005`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 05 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research