seqfun at Yahoo! Groups

c in a^(1/2) + b^(1/2) = c^(1/2) such that a^2 + b = c.

cino hilliard — Sat, 09 Feb 2008 21:59:52 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 0,1,25,225,1156,4225,12321,30625,67600,136161,255025,450241,756900,1221025,

b in a^(1/2) + b^(1/2) = c^(1/2) such that a^2 + b = c.

cino hilliard — Sat, 09 Feb 2008 21:48:02 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 0,0,9,144,900,3600,11025,28224,63504,129600,245025,435600,736164,1192464,

c^(1/2) in a^(1/2) + b^(1/2) = c^(1/2) such that a^2 + b = c.

cino hilliard — Sat, 09 Feb 2008 21:46:47 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 0,1,5,15,34,65,111,175,260,369,505,671,870,1105,1379,1695,2056,2465,2925,3439,

b^(1/2) in a^(1/2) + b^(1/2) = c^(1/2) such that a^2 + b = c.

cino hilliard — Sat, 09 Feb 2008 21:18:58 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard%I A000001%S A000001

comment on A046731

cino hilliard — Wed, 24 Oct 2007 11:05:36 GMT

From: "The On-Line Encyclopedia of Integer Sequences" Subject: COMMENT Cino Hilliard A046731 Received: 10/24/2007 12:44:05 AMThe

Re: [MATH for FUN] Re: Series business

cino hilliard — Mon, 22 Oct 2007 00:30:46 GMT

________________________________ To: mathforfun@yahoogroups.com From: no_reply@yahoogroups.com Date: Sun, 21 Oct 2007 19:03:26 +0000 Subject: [MATH for FUN]

Count primes in a range up to 10^18

Cino Hilliard — Sun, 23 Sep 2007 21:44:46 GMT

//gcc 4.1.2 //Countprimes uses Achim Flammenkamp's algorithm below. //Count the primes from start and stop up to 2^64. //Comments below with Cino show some of

Sum of prime squares < 10^n

Cino Hilliard — Sun, 02 Sep 2007 07:22:26 GMT

/* gcc 4.1.2 SumprimesSq uses Achim Flammenkamp's algorithm below. Sum the primes^2 from start and stop up to 2^64. The routine splits

Numbers of the form 2^(4^n)+5.

cino hilliard — Sat, 07 Jul 2007 13:02:34 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 7,21,65541,18446744073709551621,

Numbers of the form 2^(4^n)+5.

cino hilliard — Sat, 07 Jul 2007 12:43:25 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 7,21,65541,18446744073709551621,

Numbers of the form 4^(4^n) + 3

cino hilliard — Sat, 07 Jul 2007 12:40:43 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 7,259,4294967299,340282366920938463463374607431768211459 %N A000001 Numbers of the form 4^(4^n)

Subject: COMMENT FROM Cino Hilliard RE A110881

cino hilliard — Thu, 05 Jul 2007 14:13:18 GMT

Subject: COMMENT FROM Cino Hilliard RE A110881 %I A110881 %S A110881 1,2,4,28,58 %N A110881 Starting apriori with the fraction 1/1, list n when the numerator

Fermat numbers of order 7 or F(n,7) = 2^(2^n)+7.

cino hilliard — Thu, 05 Jul 2007 11:50:52 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 9,11,23,263,65543,4294967303,18446744073709551623, 340282366920938463463374607431768211463,

Fermat numbers of order 3 or F(n,3) = 2^(2^n)+3.

cino hilliard — Thu, 05 Jul 2007 10:47:48 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 5,7,19,259,65539,4294967299,18446744073709551619, 340282366920938463463374607431768211459,

Fermat numbers of order 3 or F(n,3) = 2^(2^n)+3.

cino hilliard — Thu, 05 Jul 2007 05:15:46 GMT

Subject: NEW SEQUENCE FROM Cino Hilliard %I A000001 %S A000001 5,7,19,259,65539,4294967299,18446744073709551619, 340282366920938463463374607431768211459,