Talk:Octahedral number

[Untitled]
This article is to be expanded by giving a formula.

(moved from the article to this discussion page - T&#949;x &#964; ur&#949; 19:49, 8 Apr 2004 (UTC))

Alternative formula
Try this: (4n3+2n)/6

~r3hall

Moderator of http://forums.delphiforums.com/figurate/start


 * The OEIS gives the formula (2n^3 + n)/3, which is obviously the same as the same as the one you give but expressed in the lowest common denominator. PrimeFan (talk) 00:29, 20 December 2007 (UTC)

1156
1156 seems to be the only octahedral square number KlokkoVanDenBerg (talk) 01:07, 9 May 2021 (UTC)
 * Not counting 0 and 1, you mean? Maybe, but we can't include this sort of information without published reliable sources. —David Eppstein (talk) 07:29, 9 May 2021 (UTC)

at least under 53.000.000.000 KlokkoVanDenBerg (talk) 23:52, 9 May 2021 (UTC)