Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026351
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026351 Floor[n*phi] + 1, where phi = (1+sqrt(5))/2. +0
7
1, 2, 4, 5, 7, 9, 10, 12, 13, 15, 17, 18, 20, 22, 23, 25, 26, 28, 30, 31, 33, 34, 36, 38, 39, 41, 43, 44, 46, 47, 49, 51, 52, 54, 56, 57, 59, 60, 62, 64, 65, 67, 68, 70, 72, 73, 75, 77, 78, 80, 81, 83, 85, 86, 88, 89, 91, 93, 94, 96, 98, 99 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = least k such that s(k) = n, where s = A026350.

LINKS

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

N. J. A. Sloane, Classic Sequences

CROSSREFS

Essentially same as A004956. Cf. A000201.

Sequence in context: A087063 A047497 A004956 this_sequence A047212 A121347 A106829

Adjacent sequences: A026348 A026349 A026350 this_sequence A026352 A026353 A026354

KEYWORD

nonn,easy,nice

AUTHOR

njas, Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.003 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 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research