login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200525 Zeisel numbers with p(0)=4. 0

%I #30 Nov 04 2019 02:31:24

%S 385,2585,7315,8911,27001,39905,48391,87283,192211,196285,319705,

%T 410089,425585,441091,624605,679855,1310185,1899163,2460439,2586971,

%U 2777041,6654005,7042411,7501261,8291459,9516637,10484585,11141671,12527281,13015891,13788319

%N Zeisel numbers with p(0)=4.

%C Pick any integers A and B and consider the linear recurrence relation given by p(0) = 4, p(i + 1) = A*p(i) + B. If for some n > 2, p(1), p(2), ..., p(n) are distinct primes, then the product of these primes is called a Zeisel number.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ZeiselNumber.html">Zeisel Number.</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Zeisel_number">Zeisel number</a>

%e a=2, b=-3 => p(1) = (4*2)+(-3) = 5; p(2) = (5*2)+(-3) = (7); p(3) = (7*2)+(-3) = 11 => 5*7*11 = 385.

%e a=2, b=5 => p(1) = (4*2)+5 = 13; p(2) = (13*2)+5 = 31; p(3) = (31*2)+5 = 67 => 13*31*67 = 27001.

%o (Rexx)

%o n0=4

%o do m=1 to 53

%o a=2*m

%o do b=(1-(4*a)) to 999

%o n1=(n0*a)+b

%o n2=(n1*a)+b

%o n3=(n2*a)+b

%o z=n1*n2*n3

%o say n0 a b

%o lineout("zeisel_4.txt",z||" = "||n1||"*"||n2||"*"||n3||" "||a||" "||b||" n0="||n0)

%o end

%o end

%Y Cf. A051015.

%K nonn

%O 1,1

%A _Karsten Meyer_, Nov 18 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)