![]() |
![]() |
#1 |
May 2004
New York City
5×7×112 Posts |
![]()
I'm trying to find a certain sequence, so far without success.
I don't want to paste pingpong balls together, especially since this obvious sequence must have already been computed or counted. Help, please? The sequence begins with 1,13,?,?,? and gives the number of identical spheres in a most tight packing around the previous smaller packing, starting with one sphere. |
![]() |
![]() |
![]() |
#2 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
427710 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
May 2004
New York City
5×7×112 Posts |
![]()
Thank you. The second sequence you found, A005902, that
begins with 1, 13, 55, 147, 309, 561, 923, 1415, is what I was looking for. I'm surprised I missed it when I searched, but I had expected the third term to be smaller. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
Where can I find a Reverse and Add program? I can't find any! | Stargate38 | Programming | 18 | 2015-07-10 06:08 |
When will we find our first terminating sequence? | 10metreh | Aliquot Sequences | 6 | 2009-05-06 11:43 |
New way to Find (X^Y) % M | maheshexp | Miscellaneous Math | 29 | 2004-08-30 15:59 |
New way to Find (X^Y) % M | maheshexp | Software | 2 | 2004-05-08 03:16 |