Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108564
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108564 a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's. +0
4
0, 1, 1, 2, 4, 8, 15, 29, 56, 18, 118, 122, 134, 239, 136, 136, 456, 679, 147, 1148, 234, 228, 1577, 1378, 1347, 345, 4467, 3577, 3679, 1268, 11299, 12389, 23568, 24458, 11477, 12789, 22279, 137, 24668, 35789, 23788, 23488, 13377, 24469, 12258, 23579 (list; graph; listen)
page 1

Search completed in 0.001 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research