id:A162753 - OEIS Search Results

Search: id:A162753

Displaying 1-1 of 1 results found.

page 1

a(0)=a(1)=2. a(n) = the smallest prime such that a(n-1)^a(n) > a(n-2)^a(n-1).

+0
2

2, 2, 3, 2, 5, 3, 5, 5, 7, 7, 11, 11, 13, 13, 17, 17, 19, 19, 23, 23, 29, 29, 31, 31, 37, 37, 41, 41, 43, 43, 47, 47, 53, 53, 59, 59, 61, 61, 67, 67, 71, 71, 73, 73, 79, 79, 83, 83, 89, 89, 97, 97, 101, 101, 103, 103, 107, 107, 109, 109, 113, 113, 127, 127, 131, 131, 137, 137 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`For n >=1, A162752(n) = a(n-1)^a(n).`
	MAPLE	`A162753 := proc(n) option remember ; if n<=1 then 2; else for i from 1 do if procname(n-1)^ithprime(i) > procname(n-2)^procname(n-1) then RETURN( ithprime(i)) ; fi; od: fi; end: seq(A162753(n), n=0..100) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 16 2009]`
	CROSSREFS	`A162752` `Sequence in context: A025476 A078773 A151663 this_sequence A111089 A051664 A029656` `Adjacent sequences: A162750 A162751 A162752 this_sequence A162754 A162755 A162756`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 12 2009`
	EXTENSIONS	`Extended beyond a(8) by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 16 2009`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research