Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135051 Pyramid game person numbers that have integer solutions for: Solve[m(m + 1)/2 + 1 - n == 0, m]. +0
1
7, 79, 191, 407, 631, 991, 1327, 1831, 2279, 2927, 3487, 4279, 4951, 5887, 6671, 7751, 8647, 9871 (list; graph; listen)
OFFSET

1,1

COMMENT

This result comes from looking for "perfect Pyramids":

Solve[m(m + 1)/2 + 1 - n == 0, m]

f[n_] = (1/2) (-1+ Sqrt[ -7 + 8 n])

Integer solutions have the form such that:

IntegerQ[2*Sqrt[ -7 + 8*n]] && Mod[n - 7, 8] == 0

FORMULA

a(n) = If[ IntegerQ[2*Sqrt[ -7 + 8*n]] && Mod[n - 7, 8] == 0, n]

MATHEMATICA

Flatten[Table[If[ IntegerQ[2*Sqrt[ -7 + 8*n]] && Mod[n - 7, 8] == 0, n, {}], {n, 1, 10000}]]

CROSSREFS

Sequence in context: A140613 A139945 A023285 this_sequence A014232 A154592 A075896

Adjacent sequences: A135048 A135049 A135050 this_sequence A135052 A135053 A135054

KEYWORD

nonn,uned

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Jan 31 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research