The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

Revision History for A073217 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A073217

The terms of A055237 (sums of two powers of 5) divided by 2.
(history; published version)

#3 by Russ Cox at Fri Mar 30 17:24:45 EDT 2012

AUTHOR

_Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), _, Jul 21 2002

Discussion

Fri Mar 30

17:24

OEIS Server: https://oeis.org/edit/global/134

#2 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

FORMULA

(5^n + 5^m) / 2, n = 0, 1, 2, 3 ..., m = 0, 1, 2, 3, ... n.

KEYWORD

easy,nonn,new

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

The terms of A055237 (sums of two powers of 5) divided by 2.

DATA

1, 3, 5, 13, 15, 25, 63, 65, 75, 125, 313, 315, 325, 375, 625, 1563, 1565, 1575, 1625, 1875, 3125, 7813, 7815, 7825, 7875, 8125, 9375, 15625, 39063, 39065, 39075, 39125, 39375, 40625, 46875, 78125

OFFSET

1,2

FORMULA

(5^n + 5^m) / 2, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.

EXAMPLE

a(4) = 13 = (5^2+5^0) / 2

CROSSREFS

Cf. A055237.

KEYWORD

easy,nonn

AUTHOR

Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), Jul 21 2002

STATUS

approved