Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098749
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098749 Let f[n_]=((n^4-n^3-1)/ (n^3-n-1))^2; then a(n) = Floor[f[n]]. +0
1
1, 1, 1, 5, 10, 17, 26, 37, 50, 65, 82, 101, 122, 145, 170, 197, 226, 257, 290, 325, 362, 401, 442, 485, 530, 577, 626, 677, 730, 785, 842, 901, 962, 1025, 1090, 1157, 1226, 1297, 1370, 1445, 1522, 1601, 1682, 1765, 1850, 1937, 2026, 2117, 2210, 2305, 2402 (list; graph; listen)
OFFSET

0,4

FORMULA

It is easy to show that Floor[((n^4-n^3-1)/ (n^3-n-1))^2] = (n-1)^2 + 1 for n >= 3. So this is essentially the same sequence as A002522. - Juan Jose Alba Gonzalez, Nov 09 2006.

MATHEMATICA

(* polynomial sequence with Theta1 to Theta0 pattern*) digits=200 f[n_]=((n^4-n^3-1)/ (n^3-n-1))^2 a=Table[Floor[f[n]], {n, 0, digits}]

CROSSREFS

Cf. A002522.

Sequence in context: A071978 A105705 A061409 this_sequence A034676 A076598 A080341

Adjacent sequences: A098746 A098747 A098748 this_sequence A098750 A098751 A098752

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 01 2004

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research